散列B1047 A1041 A1050

B1047

//B1047
#include<iostream>
using namespace std;

int main()
{
	int maxn=1010;
	int b[maxn]={0};
	int n;
	scanf("%d",&n);
	int team,member,score;
	for(int i=0;i<n;i++)
	{
		scanf("%d-%d %d",&team,&member,&score);
		b[team]+=score;
	}
	int max=-1,k=0;
    for(int i=0;i<maxn;i++)
    {
    	if(b[i]>max)
    	{
    		k=i;
    		max=b[i];
		}
	}
	printf("%d %d",k,max);
	return 0;
 } 

A1041

// 
#include<iostream>
using namespace std;
int b[10001]={0};//b数组存储a[i] 
int a[100001];//a[i]是数字 
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		b[a[i]]++;
	}
	int ans=0;
    for(int i=0;i<n;i++)
    {
    	if(b[a[i]]==1)
    	{
    		ans=a[i];
    		break;
		}
	}
	if(ans==0) printf("None");
	else printf("%d",ans);
	return 0;
}

A1050
嘿嘿嘿这道题好像比柳神的思路还要简便，好开心，我自己做的

#include<iostream>
using namespace std;

int main()
{
	string s1,s2,ans;
	getline(cin,s1);
	getline(cin,s2);
	for(int i=0;i<s1.length();i++)
	{
		if(s2.find(s1[i])==string::npos)
		{
			ans+=s1[i];
		}
	}
	cout<<ans;
	
	return 0;
 }