1039. 到底买不买（20）

水~

// 2017/10/14 NCU // PAT-B 1053// scienceZ#include <cstdio>#include <cstring>#include <stack>#include <cctype>#include <iostream>#include <algorithm>using namespace std;char arr[1010];int sum[200], ans;int main(){      cin >> arr;    int l1 = strlen(arr);    for (int i = 0; i<l1; i++) sum[arr[i]]++;    cin >> arr;    int l2 = strlen(arr);    for (int i = 0; i<l2; i++) {        if (sum[arr[i]]) sum[arr[i]]--;        else ans++;    }    if (ans) printf("No %d", ans);    else printf("Yes %d", l1-l2);    return 0;}