Submission #1646132

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
  // 入力
  int N, K;
  cin >> N >> K;
  string p[N];
  for (int i = 0; i < N; i++) cin >> p[i];

  int cnt[26];
  fill(cnt, cnt + 26, 0);
  for (int i = 0; i < N; i++) cnt[p[i][0]-'A']++;

  int ans = 0;
  while (1) {
    sort(cnt, cnt + 26);
    int i;
    for (i = 25; i >= 0; i--) {
      if (cnt[i] == 0 || i == 26 - K - 1) break;
      cnt[i]--;
    }
    if (i > 26 - K - 1) break;

    ans++;
  }

  // 解答
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result