Submission #2243468

---

Source Code Expand

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

using namespace std;
using ll = long long;

int main(){
    int N;
    cin >> N;
    vector<ll> A(N);
    unordered_map<ll,int> mp;

    for(int i=0;i<N;i++){
        cin >> A[i];
        mp[A[i]]++;
    }

    sort(A.begin(), A.end(), greater<int>());
    A.erase(unique(A.begin(), A.end()), A.end());

    int found = 0;
    ll ans = 1ll;
    for(auto itr = A.begin(); itr!=A.end(); ++itr){
        if(mp[*itr] >= 4){
            if(found == 0){
                ans = 1ll;
                ans *= *itr;
                ans *= *itr;
                found = 2;
                break;
            }else{
                ans *= *itr;
                found++;
            }
        }
        if(mp[*itr] == 2 || mp[*itr] == 3){
            found++;
            ans *= *itr;
        }

        if(found == 2){
            break;
        }
    }

    if(found < 2){
        cout << 0 << endl;
    }else{
        cout << ans << endl;
    }
    return 0;
}

Submission Info

Judge Result