Submission #1642484

---

Source Code Expand

#include "bits/stdc++.h"
#include <unordered_set>
using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
const int inf = 1000000001;
const ll INF = 1e16;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<<fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

/*
cin.tie(0);
ios::sync_with_stdio(false);
*/
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, k, i, j;
	cin >> n >> k;
	vector<char> p(n);
	for (i = 0; i < n; i++) {
		string s;
		cin >> s;
		p[i] = s[0];
	}
	sort(p.begin(),p.end());
	vi num(26);
	for (i = 0; i < n; i++) {
		num[p[i] - 'A']++;
	}
	sort(num.begin(), num.end(), greater<int>());
	ll ans = 0;
	while (true) {
		for (i = 0; i < k; i++) {
			if (num[i] == 0) {
				cout << ans << endl;
				return 0;
			}
			num[i]--;
			n--;
		}
		ans++;
		sort(num.begin(), num.end(), greater<int>());
	}
}

Submission Info

Judge Result