1039 到底买不买 (20 分)

ppRYYGrrYBR2258
YrR8RrY

第一行是摊主有的，第二行是小红想做的。我的思路是：先找出摊主所给的各个字符的个数，再比较…

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int main()
{
	string tanzhu, want;
	cin >> tanzhu >> want;
	int size[256] = { 0 };
	for (int i = 0; i < tanzhu.length(); i++)
	{
		size[tanzhu[i]]++;
	}
	int cnt = 0;
	for (int j = 0; j < want.length(); j++)
	{
		size[want[j]]--;
		if (size[want[j]] < 0)
			cnt++;
	}
	if (cnt>0)
		cout << "No" << " " << cnt;
	else
		cout << "Yes" << " " << tanzhu.length() - want.length();
	return 0;
}