poj 1922

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn=10005;
int n;
struct node
{
    int x;
    int y;
    double time;
}p[maxn];


int main()
{
    while(scanf("%d",&n),n)
    {
        int min=inf;
        for(int i=0; i<n; i++)
        {
            scanf("%d%d",&p[i].x,&p[i].y);
            if(p[i].y<0)
            {
                p[i].y=inf;
            }
            p[i].time=(4.5/p[i].x)*3600+p[i].y;
            if(p[i].time-(int)p[i].time>0)
            {
                p[i].time=(int)p[i].time+1;
            }
            if(p[i].time<min)
            {
                min=p[i].time;
            }
        }
        printf("%d\n",min);
    }
    return 0;
}