Submission #1867974

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define INF 4001

int main(){
  int n;
  cin >> n;
  vector<pair<int, int>> v;
  for(int i=0;i<n;i++){
    int a;
    cin >> a;
    int flag=0;
    for(int i=0;i<v.size();i++){
      if (v[i].second == a){
        v[i].first++;
        flag=1;
      }
    }
    if (flag==0){
      v.push_back(pair<int, int>(0, a));
    }
  }
  //cout << "case1" << endl;
  sort(v.begin(), v.end());
  int siz = v.size();
  int ind=-1;
  for(int i=0;i<siz;i++){
    if (v[i].first != 0){
      ind=i;
      break;
    }
  }
  if(ind == -1){
    cout << n << endl;
    return 0;
  }else if (ind == siz-1){
    n -= v[siz-1].first * 2;
    cout << n << endl;
    return 0;
  }
  //cout << "case2" << endl;
  int ma=v[siz-1].first;
  for(int i=siz-2;i>=ind;i--){
    if (ma == v[i].first){
      n-=ma*2;
      if(i!=0){
        i--;
        ma=v[i].first;
      }else{
        ma=0;
      }
    }else if (ma > v[i].first){
      n-=v[i].first*2;
      ma-=v[i].first;
    }else{
      n-=ma*2;
      ma=v[i].first-ma;
      i--;
    }
  }
  //cout << "case3" << endl;
  if(ma>0){
    n-=ma;
  }
  cout << n << endl;
  return 0;
}

Submission Info

Judge Result