1092. To Buy or Not to Buy (20)

#include <iostream>
#include <string.h>

using namespace std;

int aflag[130], bflag[130];

int main()
{
	char a[1010], b[1010];
	gets(a);
	gets(b);

	int len = strlen(a), i;
	char ch;

	for(i = 0; i < len; i++)
	{
		ch = a[i];
		aflag[ch]++;
	}

	len = strlen(b);
	for(i = 0; i < len; i++)
	{
		ch = b[i];
		bflag[ch]++;
	}

	int res1 = 0, res2 = 0, flag = 1;
	for(i = 0; i <= 127; i++)
	{
		if(aflag[i] >= bflag[i])
		{
			res1 += aflag[i] - bflag[i];
		}
		else
		{
			flag = 0;
			res2 += bflag[i] - aflag[i];
		}
	}

	if(flag == 1)
	{
		printf("Yes %d\n", res1);
	}
	else
	{
		printf("No %d\n", res2);
	}

	system("pause");
	return 0;
}

 

posted on 2025-11-23 17:22  王景迁  阅读(3)  评论(0)    收藏  举报

导航