blob: fc7028cc571e19b78ad0a17e6f636bcf1f29a1ee (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
import java.io.*;
import java.util.*;
public class MaxPairProduct {
int numberOfIntegers;
int biggest;
int bigger;
public MaxPairProduct(int size) {
numberOfIntegers = size;
}
public int getCount() {
return numberOfIntegers;
}
public static void main(String[] args) {
FastScanner s = new FastScanner(System.in);
int n = s.nextInt();
MaxPairProduct mpp = new MaxPairProduct(n);
for (int i = 0; i < n; i++) {
mpp.newNumber(s.nextInt());
}
System.out.println(mpp.getProduct());
}
public int getBiggest() {
return biggest;
}
public int getBigger() {
return bigger;
}
public void newNumber(int i) {
if (i > biggest) {
bigger = biggest;
biggest = i;
} else if (i == biggest) {
bigger = i;
} else if (i > bigger) {
bigger = i;
}
}
public long getProduct() {
if (numberOfIntegers == 0) {
return (long) 0;
} else if (numberOfIntegers == 1) {
return (long) biggest;
}
return (long) biggest * (long) bigger;
}
static class FastScanner {
BufferedReader br;
StringTokenizer st;
FastScanner(InputStream stream) {
try {
br = new BufferedReader(new InputStreamReader(stream));
} catch (Exception e) {
e.printStackTrace();
}
}
String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
}
|
