PAT 乙级 1039 到底买不买 (20分)

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

int main()
{
	string a, b;//a长的，b目标
	cin >> a >> b;
	int count = 0,num=0;
	for (int i = 0; i < b.length(); i++)
	{
		int m = std::count(a.begin(),a.end(),b[i]);
		int n = std::count(b.begin(),b.end(),b[i]);
		if (m >= n)
		{
			count++;
		}
		else
			num++;
	}
	if (count == b.length())
	{
		cout << "Yes " << a.length() - b.length();
	}
	else
	{
		cout << "No " << num-1;
	}
	system("pause");
	return 0;
}

orz