标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14739 Accepted Submission(s): 3643
#include <iostream> #include <cmath> #include <algorithm> using namespace std; struct w { string s; int money; int v; double price; }k[110]; int cmp(w x, w y) { if (x.price!=y.price) return x.price<y.price; else return x.v>y.v; } int main() { int t,n; cin>>t; while (t--) { cin>>n; for (int i=0;i<n;i++) { cin>>k[i].s>>k[i].money>>k[i].v; int day=k[i].v/200; if (day>5) day=5; if (k[i].v<200) k[i].price=99999; else k[i].price=k[i].money*1.0/day; } sort(k,k+n,cmp); cout <<k[0].s<<endl; } return 0; }
标签:
原文地址:http://www.cnblogs.com/arno-my-boke/p/4241824.html