POJ 2656 解题报告

/*
ID: thestor1
LANG: C++
TASK: poj2656
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

int main()
{
int n;
while (scanf("%d", &n) && n)
{
int unhappiest = 0, maxstudyhours = 0;
for (int i = 0; i < n; ++i)
{
int school, supplementary;
scanf("%d%d", &school, &supplementary);
int studyhours = school + supplementary;
if (studyhours > 8)
{
if (studyhours > maxstudyhours)
{
maxstudyhours = studyhours;
unhappiest = i + 1;
}
}
}

printf("%d\n", unhappiest);
}
return 0;
}