PKU 3138 ACM Team Selection

• 素直に実装するのみ
• 問題文を読み間違えて1WA

int main() {
	int caseIndex = 0;
	for (int S, T, M; cin >> S >> T >> M && (S || T || M); ) {
		int counter[128][3];
		memset(counter, 0, sizeof(counter));

		for (int s = 0; s < S; ++s) {
			int Id;
			cin >> Id;
			cin >> counter[Id][0] >> counter[Id][1];
		}

		for (int t = 0; t < T; ++t) {
			int Sid, Tot;
			cin >> Sid >> Tot;
			counter[Sid][2] |= (Tot >= M ? 1 : 0);
		}

		int answer = 0;
		for (int s = 1; s <= S; ++s) {
			answer += counter[s][0] + counter[s][1] + counter[s][2];
		}

		printf("Case %d: %d\n", ++caseIndex, answer);
	}
}