problem

1092 To Buy or Not to Buy (20分)
Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole pieces. Hence Eva must check whether a string in the shop contains all the beads she needs. She now comes to you for help: if the answer is Yes, please tell her the number of extra beads she has to buy; or if the answer is No, please tell her the number of beads missing from the string.

For the sake of simplicity, let’s use the characters in the ranges [0-9], [a-z], and [A-Z] to represent the colors. For example, the 3rd string in Figure 1 is the one that Eva would like to make. Then the 1st string is okay since it contains all the necessary beads with 8 extra ones; yet the 2nd one is not since there is no black bead and one less red bead.

figbuy.jpg

Figure 1

Input Specification:
Each input file contains one test case. Each case gives in two lines the strings of no more than 1000 beads which belong to the shop owner and Eva, respectively.

Output Specification:
For each test case, print your answer in one line. If the answer is Yes, then also output the number of extra beads Eva has to buy; or if the answer is No, then also output the number of beads missing from the string. There must be exactly 1 space between the answer and the number.

Sample Input 1:
ppRYYGrrYBR2258
YrR8RrY
Sample Output 1:
Yes 8
Sample Input 2:
ppRYYGrrYB225
YrR8RrY
Sample Output 2:
No 2

solution

英文看半天没看懂
一键翻译就是个水题
统计A串比B串少多少珠子，如果覆盖了就yes

#include<iostream>
#include<string>
using namespace std;
int n1[1010], n2[1010];
int main(){
  string s, t;
  cin>>s>>t;
  for(int i = 0; i < s.size(); i++)
    n1[s[i]-'0']++;
  for(int i = 0; i < t.size(); i++)
    n2[t[i]-'0']++;
  int ok = 1;
  int tmp = 0;
  for(int i = 0; i <= 1000; i++){
    if(n2[i]>n1[i]){
      ok = 0;
      tmp += n2[i]-n1[i];
    }
  }
  if(ok)cout<<"Yes "<<s.size()-t.size()<<endl;
  else cout<<"No "<<tmp<<endl;
  return 0;
}