summaryrefslogtreecommitdiff
path: root/AlgoDesignAndTechniqueEdxJava/sources/MaxPairProduct.java
blob: 18b9521d8b8604ef4020ca17926a0c2ea13348f1 (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
import java.util.Scanner;

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) {
		Scanner s = new Scanner(System.in);
		
		int n = s.nextInt();
		MaxPairProduct mpp = new MaxPairProduct(n);
		for (int i = 0; i<n; i++) {
			mpp.newNumber(s.nextInt());
		}
		
		s.close();
		
		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;
	}

}