| Time Limit: 1000MS | Memory Limit: 30000K | |
| Total Submissions: 18704 | Accepted: 7552 |
Description
We may assume that all the students except "Charley" ride from
Wanliu to Yanyuan at a fixed speed. Charley is a student with a
different riding habit – he always tries to follow another rider to
avoid riding alone. When Charley gets to the gate of Wanliu, he will
look for someone who is setting off to Yanyuan. If he finds someone, he
will follow that rider, or if not, he will wait for someone to follow.
On the way from Wanliu to Yanyuan, at any time if a faster student
surpassed Charley, he will leave the rider he is following and speed up
to follow the faster one.
We assume the time that Charley gets to the gate of Wanliu is zero.
Given the set off time and speed of the other students, your task is to
give the time when Charley arrives at Yanyuan.
Input
are several test cases. The first line of each case is N (1 <= N
<= 10000) representing the number of riders (excluding Charley). N =
0 ends the input. The following N lines are information of N different
riders, in such format:
Vi [TAB] Ti
Vi is a positive integer <= 40, indicating the speed of the i-th
rider (kph, kilometers per hour). Ti is the set off time of the i-th
rider, which is an integer and counted in seconds. In any case it is
assured that there always exists a nonnegative Ti.
Output
Sample Input
4
20 0
25 -155
27 190
30 240
2
21 0
22 34
0
Sample Output
780
771
Source
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std; int main()
{
int n;
const double distance = 4.5;
while(scanf("%d",&n)!=EOF&&n!=)
{
double x,t,v,min = 1e100;
for(int i = ;i<n;i++)
{
scanf("%lf%lf",&v,&t);
x =distance*/v+t;
if(t>=&&x<min)
min = x;
}
printf("%.0lf\n",ceil(min));
}
return ;
}