标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 51740 Accepted Submission(s):
17347
1 #include<stdio.h> 2 #include<algorithm> 3 using namespace std; 4 struct d 5 { 6 double m,n; 7 double value; 8 }; 9 10 d sum[100000]; 11 12 bool cmp(d m,d n) 13 { 14 return m.value>n.value; 15 } 16 17 int main() 18 { 19 int a,b; 20 while(~scanf("%d %d",&a,&b)) 21 { 22 if(a==-1&&b==-1) 23 break; 24 int i; 25 double total=0,c=0; 26 for(i=0;i<b;i++) 27 { 28 scanf("%lf %lf",&sum[i].m,&sum[i].n); 29 sum[i].value=sum[i].m/sum[i].n; 30 } 31 32 sort(sum,sum+b,cmp); 33 34 /* for(i=0;i<b;i++) //为什么注释掉的部分for循环结束后,不加if语句OJ就一直错,搞不懂; 35 { 36 a-=sum[i].n; 37 if(a>=0) 38 total+=sum[i].m; 39 else 40 break; 41 }*/ 42 for(i=0;i<b;i++) 43 { 44 if(a>sum[i].n) 45 { 46 total+=sum[i].m; 47 a-=sum[i].n; 48 } 49 else 50 { 51 c=1; 52 total+=a*sum[i].value; 53 } 54 if(c!=0) 55 break; 56 } 57 /*if(a<0) 58 total+=(a+sum[i].n)*sum[i].value; 59 */printf("%.3lf\n",total); 60 } 61 return 0; 62 }
标签:
原文地址:http://www.cnblogs.com/fengshun/p/4548849.html