标签:des style blog http color java os strong
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 42882 Accepted Submission(s): 14310
#include<iostream> #include<algorithm> using namespace std; struct room { double n; double h; }; int cmp(room a, room b) { return a.h/a.n > b.h/b.n; } int main() { int v; int n; room r[1100]; while(cin>>v>>n) { if(v == -1)break; int i; double total = 0; for(i = 0; i < n; ++i) cin>>r[i].h>>r[i].n; sort(r,r+n,cmp); /* for(i = 0; i < n; ++i) cout<<r[i].h<<‘ ‘<<r[i].n<<endl;*/ for(i = 0 ; i < n ; ++i) { if(v == 0)break; if(v >= r[i].n) { v -= r[i].n; total += r[i].h; } else { total += r[i].h/r[i].n*v; // v = 0; break; } } printf("%.3lf\n",total); } return 0; }
#include<iostream>
#include<algorithm>
using namespace std;
struct room
{
double n;
double h;
};
int cmp(room a, room b)
{
return a.h/a.n > b.h/b.n;
}
int main()
{
int v;
int n;
room r[1100];
while(cin>>v>>n)
{
if(v == -1)break;
int i;
double total = 0;
for(i = 0; i < n; ++i)
cin>>r[i].h>>r[i].n;
sort(r,r+n,cmp);
/* for(i = 0; i < n; ++i)
cout<<r[i].h<<‘ ‘<<r[i].n<<endl;*/
for(i = 0 ; i < n ; ++i)
{
if(v == 0)break;
if(v >= r[i].n)
{
v -= r[i].n;
total += r[i].h;
}
else {
total += r[i].h/r[i].n*v;
// v = 0;
break;
}
}
printf("%.3lf\n",total);
}
return 0;
}
hdu 1009 FatMouse' Trade,布布扣,bubuko.com
标签:des style blog http color java os strong
原文地址:http://www.cnblogs.com/2014acm/p/3885479.html