ZOJ-2229

想通了就很简单，time小于0的不考虑，主人公到达的时间一定是和time大于0最先到达的人一起到达的

#include<stdio.h>
#include<math.h>

int main()
{
	int n, v, t;
	double cons = 4.5 * 3600;
	while (scanf("%d", &n), n)
	{
		double min = 0xFFFFFFFF;
		while (n--)
		{
			scanf("%d %d", &v, &t);
			if (t >= 0)
			{
				double time = cons / v + t;
				if (time < min)
					min = time;
			}
		}
		printf("%d\n", (int) ceil(min));
	}
	return 0;
}