1092 To Buy or Not to Buy (20分) PAT

 

#include<string>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<map>

using namespace std;
int c[256] = {0}, d[256] = {0};

void count_bead(string s, int t[]) {
    int len = s.size(), temp;
    for (int i = 0; i < len; i++) {
        if (s[i] >= '0' && s[i] <= '9') {
            temp = s[i];
            t[temp]++;
        }
        else if (s[i] >= 'a' && s[i] <= 'z') {
            temp = s[i];
            t[temp]++;
        }
        else if (s[i] >= 'A' && s[i] <= 'Z') {
            temp = s[i];
            t[temp]++;
        }
    }
    return;
}

int main() {
    string shop, eva;
    cin >> shop >> eva;
    count_bead(shop, c);
    count_bead(eva, d);
    int les = 0, more = 0;
    for (int i = 0; i < 256; i++) {
        if (c[i] == d[i]) continue;
        else if (c[i] > d[i]) more += c[i] - d[i];
        else if (d[i] > c[i]) les += d[i] - c[i];
    }
    if (les > 0) {
        printf("No %d\n", les);
    }
    else printf("Yes %d\n", more);
    return 0;
}