PAT A1092 To Buy or Not to Buy

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char shop[1001];
char Eva[1001];
//初始状态两个数组都为零 ASC1存shop每个珠子的个数 ASC2存Eva每个珠子的个数
int ASC1[128];
int ASC2[128];
int main(){
	int flag=1;//标志输出Y or N
	fill(ASC1,ASC1+128,0);
	fill(ASC2,ASC2+128,0);
	scanf("%s",shop);
	scanf("%s",Eva);
	int len1= strlen(shop);
	int len2= strlen(Eva);
	
	for(int i=0;i<len1;i++){
		ASC1[shop[i]]++;	
	}
	for(int i=0;i<len2;i++){
		ASC2[Eva[i]]++;
	}
	int miss=0;
	int over=0;
	for(int i=0;i<128;i++){
		if(ASC1[i]-ASC2[i]<0){
			flag=0;
			miss+=ASC2[i]-ASC1[i];
		}
	}
	if(flag){
		for(int i=0;i<128;i++){
			if(ASC1[i]-ASC2[i]>0){
				over+=ASC1[i]-ASC2[i];
			}
		}
		printf("Yes %d",over);
	}else{
		printf("No %d",miss);
	}
	return 0;
}