3088214_ac_312ms_4728k.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;

public class Main
{
	public static void main(String [] args)
	{
		new Main().solve();
	}

	private void solve()
	{
		int cas = 0;
		int S, T, M;
		int Id, P, Q;
		int Sid, Tot;
		Scanner cin = new Scanner (System.in);

		for( ; ; )
		{
			S = cin.nextInt();
			T = cin.nextInt();
			M = cin.nextInt();
			if(S==0&&T==0&&M==0)
			{
				break;
			}
			cas++;
			int [] cnt = new int [S+1];
			int [] tot = new int [S+1];
			for(int i = 1; i <= S; i++)
			{
				Id = cin.nextInt();
				P  = cin.nextInt();
				Q  = cin.nextInt();
				cnt[Id] += P+Q;
			}
			for(int i = 1; i <= T; i++)
			{
				Sid = cin.nextInt();
				Tot = cin.nextInt();
				if(Tot > tot[Sid])
				{
					tot[Sid] = Tot;
				}
			}
			int ans = 0;
			for(int i = 1; i <= S; i++)
			{
				if(tot[i] >= M)
				{
					cnt[i]++;
				}
				ans += cnt[i];
			}
			System.out.println("Case "+cas+": "+ans);
		}
	}
}