Codeforces 429 A. Generous Kefa

题目网址： Codeforces 429 A. Generous Kefa

思路

• 计数每种颜色气球的个数
• 若某种颜色气球颜色多于k，则输出NO，否则YES

代码

#include <bits/stdc++.h>using namespace std;const int SIZE = 105;char color[SIZE];unordered_map<char, int> mp;int main(int argc, char const *argv[]){    int n, k;    while (~scanf("%d %d", &n, &k))    {        bool flag = true;        mp.clear();        scanf("%s", color);        for (int i = 0; i < n; ++i)        {            ++mp[color[i]];            if (mp[color[i]] > k)            {                flag = false;            }        }        if(flag) printf("YES\n");        else printf("NO\n");    }    return 0;}