Submission #2527903

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
using namespace std;
using ll = int long long;
map <int ,int> mpa,mpb;

int main (){
  ll N;
  cin  >> N;
  ll a[N];
  ll ans=0;
  ll l=0,r=0;
  for(ll i=0;i<N;i++){
    cin >> a[i];
  }
  sort(a,a+N);
  ll k=1;
  ll tmp;
  for(ll i=1;i<N;i++){
    if(a[i-1]==a[i]){
      k++;
      l=a[i];
      if(k>=4){
        l=r=a[i];
      }
      continue;
    }
    else{
      tmp=l;
      l=r;
      r=tmp;
      k=1;
    }
  }
  ans=l*r;
  cout << ans;
}

Submission Info

Judge Result