1039 到底买不买 (20 分)（C++）

#include <iostream>
using namespace std;
int main (){
    int v1[256] = {0};    //摊主
    int v2[256] = {0};    //小红
    string s1;
    string s2;
    cin >> s1 >> s2;

    for(int i = 0;i < s1.length();i++) {v1[s1[i]]++;}
    for(int i = 0;i < s2.length();i++) {v2[s2[i]]++;}

    int lack = 0; //缺少的个数
//    for(int i = 0;i < s2.length();i++){ //此种写法存在同一个字符lack叠加多次的情况
//        if(v2[s2[i]] > v1[s2[i]])
//            lack += v2[s2[i]] - v1[s2[i]];
//            v2[s2[i]] = v1[s2[i]]; //加上这行才正确
//    }
    
    for(int i = 0;i < 128;i++){
            if(v2[i] > v1[i]){
                lack += v2[i] - v1[i];
            }
    }
    if(lack == 0){
        cout << "Yes" << " " << s1.length() - s2.length();
    }else
        cout << "No" << " " << lack;
    return 0;
}