1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int n; cin >> n;
  deque<int> cnt(n);
  for (int i = 0; i < n; i++) {
    int x; cin >> x;
    // x--;
    cnt[x-1]++;
  }
  sort(cnt.rbegin(), cnt.rend());
  int res = 0;
  while (!cnt.empty()) {
    while (cnt.front() > 1) {
      if (cnt.front() > cnt.back()) {
        cnt.front() -= cnt.back();
        cnt.pop_back();
      } else {
        cnt.back() -= cnt.front()-1;
        break;
      }
    }
    debug(cnt);
    cnt.pop_front();
    res++;
  }
  cout << res << '\n';
}