POJ 2656 Unhappy Jinjin

#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
");
        else printf("%d
", maxday);
    }
    return 0;
}
原文地址:https://www.cnblogs.com/zufezzt/p/4658371.html