Submission #1608652

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#include <array>
#include <stdlib.h>

#define INT_MAX 2000000000
#define MOD 1000000007
#define ll long long;
#define REP(i,a,b) for(i = (a); i < (b); i++)
#define rep(i,n) REP(i,0,n)
#define bitget(a,b) (((a) >> (b)) & 1)

using namespace std;

int i, j, k;

int main() {
	int n;
	int a[100000];
	cin >> n;
	rep(i, n) {
		cin >> a[i];
	}
	sort(a,a+n);
	int d = 1;
	int ans1 = 0, ans2 = 0;
	for (i = n - 2; i > -1; i--) {
		if (a[i] == a[i + 1]) {
			d++;
		}
		else {
			d = 1;
		}
		if (d == 2) {
			if (ans1 == 0) {
				ans1 = a[i];
				d = 0;
			}
			else {
				ans2 = a[i];
				d = -1;
			}
		}
		if (d == -1) {
			break;
		}
	}
	cout << ans1*ans2 << endl;

	return 0;
}

Submission Info

Judge Result