Submission #2863405

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
int n;
vector <int> tab;
int main() {
    cin >> n;
    int a;
    int s1;
    bool f = false ;
    for(int i = 1; i <= n ; i++){
        cin >> a;
        tab.push_back(a);
    }
    sort(tab.begin(),tab.end());
    int i = n;
    while( i > 1){
        i--;
        if(tab[i] == tab[i-1]){
            if(f){
                cout << s1 * tab[i] ;
                return 0;
            }else{
                f = true;
                s1 = tab[i];

            }
        i--;
        }
    }
    cout << 0 ;
    return 0;
}

Submission Info

Judge Result