PAT（甲级）1092. To Buy or Not to Buy (20)

题目：https://www.patest.cn/contests/pat-a-practise/1092

代码：

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{
	int a[128]={0};
	char s1[1010],s2[1020];
	gets(s1);
	gets(s2);
	for(int i=0;i<strlen(s2);i++){
	     a[(int)s2[i]]++;
	}
	int miss=strlen(s2);
	for(int i=0;i<strlen(s1);i++){
		if(a[(int)s1[i]]>0){
		   a[(int)s1[i]]--;
		   miss--;
		}
	}
	if(miss==0){
	   printf("Yes %d\n",strlen(s1)-strlen(s2));
	}else{
	   printf("No %d\n",miss);
	}
	system("pause");
}