Submission #1643050

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for( int i = 0; i < n; i++ )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000


int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,K;
    cin >> N;
    cin >> K;
    string S;
    int count[27] = {};
    rep(i ,N) {
        cin >> S;
        count[S[0] - 'A']++;
    }
    int ans = 0;
    int flag = 0;
    while(true) {
        sort(count, count+27, greater<int>());
        rep(i,K) {
            if (count[i] > 0) count[i]--;
            else {
                flag = 1;
                break;
            }
        }
        if (flag == 1) break;
        ans++;
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result