Submission

Score: 100

User: VggT

Problemset: กองชาม

Language: cpp

Time: 0.024 second

Submitted On: 2025-10-17 10:10:20

#include <bits/stdc++.h>
using namespace std;
int main()
{
	
	int n, count = 0;
	cin >> n;
	
	vector<int> vec(n);
	map<int,int, greater<int>> m;
	
	for(auto & a : vec)
	{
		cin >> a;
		m[a]+=1;
	}
	
	sort(vec.begin(),vec.end());
	

	
	
	while(!m.empty())
	{
		set<int> keys;
		
		for(auto &l : m)
		{
			l.second-=1;			
			keys.insert(l.first);
		}
		
		
		for(auto a : keys)
		{
			if(m[a] <= 0)
			{
				m.erase(a);
			}
		}
		count+=1;
	}
	
	cout << count;
	
	return 0;
}