【CodeForce #239 Div2】408B——Garland

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

int need[26];
int had[26];

int main()
{
	string have,wants;
	cin>>have;
	cin>>wants;
	memset(need,0,sizeof(need));
	memset(had,0,sizeof(had));
	for(int i=0;i<have.length();i++)
	{
		had[(int)(have[i]-'a')]++;
	}
	for(int i=0;i<wants.length();i++)
	{
		 need[(int)(wants[i]-'a')]++;
	}
	int totalneedpaper=0;
	
	for(int j=0;j<26;j++)
	{
		if(need[j]!=0)
		{
			if(had[j]==0)
			{
				totalneedpaper=-1;
				goto end;
			}
			else
			{
				if(need[j]<=had[j])
					totalneedpaper+=need[j];
				else
					totalneedpaper+=had[j];
			}
		}
	}
end:
	cout<<totalneedpaper<<endl;
	
	
	
	
	
	
	
	
	
	
	return 0;
}