题解——Codeforces Round #508 (Div. 2) T1 (模拟)

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>
using namespace std;
char s[100100];
int n,k,barrel[30];
int main(){
  scanf("%d %d",&n,&k);
  scanf("%s",s+1);
  for(int i=1;i<=n;i++)
     barrel[s[i]-‘A‘+1]++;
  int ans=0x3f3f3f3f;
  for(int i=1;i<=k;i++)
    ans=min(ans,barrel[i]);
  printf("%d\n",ans*k);
  return 0;
}