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
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
#include <bits/stdc++.h>
#define ll long long

using namespace std;

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

	vector<int> il, wy;

	int n, a;
	cin >> n;

	il.resize(n + 1);

	for (int i = 0; i < n; ++i)
	{
		cin >> a;
		++il[a];
	}

	for (int i = 0; i <= n; ++i)
		if (il[i] > 0)
			wy.push_back(il[i]);

	sort(wy.begin(), wy.end());

	vector<bool> wz(wy.size());

	int i = wy.size();
	int wyn = 0;

	while (i > 0)
	{
		--i;

		if (wz[i])
			continue;

		wz[i] = true;

		int sm = 0;
		int j = i - 1;
		++wyn;

		while (j > -1)
		{
			if (!wz[j])
				if (sm + wy[j] < wy[i])
				{
					wz[j] = true;
					sm += wy[j];

					if (sm + 1 == wy[i])
						break;
				}

			--j;
		}
	}

	wz = {};
	wz.resize(wy.size());

	i = wy.size();
	int twyn = 0;

	while (i > 0)
	{
		--i;

		if (wz[i])
			continue;

		wz[i] = true;

		int sm = 0;
		int j = 0;
		++twyn;

		while (j < i)
		{
			if (!wz[j])
				if (sm + wy[j] < wy[i])
				{
					wz[j] = true;
					sm += wy[j];

					if (sm + 1 == wy[i])
						break;
				}

			++j;
		}
	}

	cout << min(wyn, twyn);

	return 0;
}