查理回学校

贪心练习第11题
原题：
Many graduate students of Peking University are living in Wanliu Campus, which is 4.5 kilometers from the main campus – Yanyuan. Students in Wanliu have to either take a bus or ride a bike to go to school. Due to the bad traffic in Beijing, many students choose to ride a bike.

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
There 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
Output one line for each case: the arrival time of Charley. Round up (ceiling) the value when dealing with a fraction.
Sample Input
4
20 0
25 -155
27 190
30 240
2
21 0
22 34
0
Sample Output
780
771
题意：
有一段路，查理跟着别人后面骑车，如果另一个超过则跟着另一个人。求到达终点所用的时间。
思路：
本题根据所经过的人里面选取这段时间内最先到达终点的时间就为答案，可以看做查理一直跟着这个人，因为是他先经过的终点其他人还都在这一段路程中。
其实这个题我刚开始的思路是正确的，给定的测试案例也都通过了，但就是AC不了，最后发现没有排序，导致交了很多次。

#include<iostream>
#include<algorithm>
#include<math.h>
#include<stdio.h>
#include<cstring>
#include <queue>
using namespace std;
struct ch{
int a,b;
bool flag;

}arr[10005];
bool cmp(ch a,ch b)
{
    if(a.b!=b.b)
        return a.b<b.b;
    else
        return a.a>b.a;
}


int main()
{
     int n;
     while(cin>>n)
     {
         if(n==0)
            break;
         for(int i=1;i<=n;i++)
         {
             cin>>arr[i].a>>arr[i].b;
         if(arr[i].b<0)
            arr[i].flag=true;
         else
            arr[i].flag=false;
         }
            sort(arr+1,arr+n+1,cmp);
          double time;
          for(int i=1;i<=n;i++)
            if(arr[i].flag!=true)
          {time=(4.5/arr[i].a*3600)+arr[i].b;break;}
         for(int i=1;i<=n;i++)
         {
             double a;
            if(arr[i].flag==true)
                continue;
                a=(16200*1.0/arr[i].a)+arr[i].b;
             time=min(time,a);

             }
             cout<<ceil(time)<<endl;



         }



     }