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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
// Author: Kajetan Ramsza
#include "bits/stdc++.h"
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template<typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T> ostream &operator<<(ostream & os, const vector<T> &v) { os << "{"; typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; }

void dbg_out() { cerr<<'\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr<<' '<<H; dbg_out(T...); }

#ifdef DEBUG
#define dbg(...) cerr<<"(" << #__VA_ARGS__ <<"):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 
#endif

const int maxn = int(5e5) + 7;

int n;
int cnt[maxn];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin>>n;
	rep(i,0,n){
		int x; 
		cin>>x;
		cnt[x]++;
	}
	vi nums;
	rep(i,0,maxn)
		if(cnt[i]) nums.push_back(cnt[i]);
	sort(all(nums));
	int pnt = 0, res = 0;
	while(pnt < sz(nums)) {
		int val = nums.back();
		nums.pop_back();
		res++;
		int sum = 0;
		while(pnt < sz(nums) && sum < val-1) {
			if(sum + nums[pnt] >= val) {
				nums[pnt] -= val-1 - sum;
				sum = val-1;
			} else {
				sum += nums[pnt];
				pnt++;
			}
		}
	}
	cout<<res<<'\n';
}