Submission #1996234

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> P;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << endl
const ll INF = 1e+9+7;
ll n,m,l;
string s,t;
ull d[100000],dp[100][100];

int main(){
  vll vec;
  cin >> n;
  rep(i,0,n){
    cin >> m;
    vec.pb(m);
  }
  sort(all(vec),greater<int>());
  m = 0;
  l = vec[0];
  ll ans = 0;
  short count = 0;
  rep(i,0,n){
    if(vec[i] == l)m++;
    else{
      if(m >= 4){
        //４つ同じやつ
        if(ans == 0)ans = l * l;
        else ans *= l;
        count += 2;
        break;
      }else if(m >= 2){
        //２つ同じやつがあったら
        if(ans != 0){
          //２つ目の辺
          ans *= l;
          count++;
          break;
        }else{
          //１つ目の辺
          count++;
          ans = l;
        }
      }
      m = 1;
      l = vec[i];
    }
  }
  print(ans);
  return 0;
}

Submission Info

Judge Result