//2023/9/23
//号家军鲍司哲
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int idata=10000+5;
int n,m;
int cnt,flag;
double minn=INT_MAX,maxx=-1;
int sum;
bool judge;
struct peo{
int tim;
int speed;
}peo[idata];
int main(){
int i,j;
while(cin>>n&&n){
minn=99999999;
for(i=1;i<=n;i++){
cin>>peo[i].speed>>peo[i].tim;
if(peo[i].tim>=0){
if(minn>4.5/peo[i].speed *3600+peo[i].tim){
minn=4.5/peo[i].speed *3600+peo[i].tim;
}
}
}
cout<<ceil(minn)<<endl;
}
return 0;
}
1227:Ride to Office
最新推荐文章于 2023-12-23 14:49:49 发布