散列 1092 To Buy or Not to Buy （20 分)

水题

#include <cstdio>
#include <map>
#include <cstring>
using namespace std;

int main()
{
	int sum=0,miss=0,flag = 0;
	map <char,int> mp;
	char t1[1010],t2[1010];
	scanf("%s %s",t1,t2);
	sum = strlen(t1);
	for(int i = 0;i<strlen(t1);i++)
	{
		mp[t1[i]] ++;
	}
	for(int i = 0;i<strlen(t2);i++)
	{
		if(mp[t2[i]] > 0)
		{
			mp[t2[i]]--;
			sum--;
		}
		else
		{
			flag=1;
			miss++;
		}
	}
	for(int i = 0;i<strlen(t2);i++)
	{
		if(mp[t2[i]] < 0)
		{
			flag = 1;
			miss++;
		}
	}
	if(flag == 1)
		printf("No %d",miss);
	else
		printf("Yes %d",sum);
	
	
	
	
	return 0;
 }