Generous Kefa CodeForces - 841A

大水题

妈耶，，，我竟然写出了bug

下面是 AC 代码

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
// cout << "  ===  " << endl;

using namespace std;
typedef long long ll;
const int maxn = 1000 + 7, INF = 0x7f7f7f7f, mod = 1e9+7;
int n, k;
char s[maxn];

int main() {
    scanf("%d %d", &n, &k);
    scanf("%s", s);
    for(int i = 0; i < n; ++i) {
        if(s[i] >= 'A' && s[i] <= 'Z')
            s[i] = s[i] - 'A' + 'a';
    }
    sort(s, s+n);
    int cnt = 1;
    for(int i = 1; i < n; ++i) {
        if(s[i] != s[i-1]) cnt = 1;
        else {
            cnt++;
            if(cnt > k) { puts("NO"); return 0; }
        }
    }
    puts("YES");
    return 0;
}