POJ 2656.Unhappy Jinjin

水

题目链接

#include <iostream>
using namespace std;
int main(void)
{
	while(1)
	{
		int n;
		scanf("%d",&n);
		int max = -1;
		int jilu = 0;
		if(!n) return 0;
		for(int i=0;i<n;i++)
		{
			int p,q;
			scanf("%d%d",&p,&q);
			if(p+q<=8) continue;
			if(p+q>max)
			{
				max = p+q;
				jilu = i+1;
				
			}
		}
		printf("%d\n",jilu);
	}	
}