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

时间:2023-03-09 08:03:27
题解——Codeforces Round #508 (Div. 2) T1 (模拟)

依照题意暴力模拟即可A掉

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