Submission

Score: 100

User: VggT

Problemset: พอด

Language: cpp

Time: 0.022 second

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

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n, k;
	cin >> n >> k;
	vector<queue<int>> vec(k);
	
	for(int i = 0; i < n; i+=1)
	{
		int num;
		cin >> num;
		vec[num-1].push(num);
		bool isfull = true;
		
		for(int j = 0; j < k; j+=1)
		{
			if(!isfull) break;
			if(vec[j].empty()) isfull = false;
		}
		
		if(isfull)
		{
			for(int j = 0; j < k; j+=1)
			{
				vec[j].pop();
			}
		}
		
		
	}
	
	int count = 0;
	
	for(int i = 0; i < vec.size(); i+=1)
	{
		count+=vec[i].size();
	}
	
	cout << count;
	
	
	return 0;
}