2656.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 49 行

Source

Problem Id:2656  User Id:fzk 
Memory:40K  Time:0MS
Language:G++  Result:Accepted

Source 

#include <stdio.h>

int main(){

	while(1) {

		int i, n;

		int maxday, maxvalue = -1;

		scanf("%d", &n);

		if (n == 0) break;

		for (i = 1; i <= n; i++) {

			int a, b;

			scanf("%d%d", &a, &b);

			if (a + b > maxvalue) {

				maxvalue = a + b;

				maxday = i;

			}

		}

		if (maxvalue <= 8) printf("0\n");

		else printf("%d\n", maxday);

	}

	return 0;

}