3138.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Source

Problem Id:3138  User Id:fzk 
Memory:40K  Time:15MS
Language:G++  Result:Accepted

Source 

#include<stdio.h>

int school[101],nCase,flag[101];

int main(){
	int s,t,m,i,sn,c2,c3,pn,tot;

	scanf("%d %d %d",&s,&t,&m);
	while (!(s==0 && t==0 && m==0)){
		nCase++;
		for (i=0;i<101;i++) {
			school[i]=0;
			flag[i]=0;
		}
		tot=0;

		for (i=1;i<=s;i++){
			scanf("%d %d %d",&sn,&c2,&c3);
			school[sn]+=c2+c3;
		}
		for (i=1;i<=t;i++){
			scanf("%d %d",&sn,&pn);
			if (flag[sn]==0 && pn>=m) {
				school[sn]++;
				flag[sn]=1;
			}
		}
		for (i=1;i<=s;i++)
			tot+=school[i];
		printf("Case %d: %d\n",nCase,tot);

		scanf("%d %d %d",&s,&t,&m);
	}

	return 0;
}