解题思路:典型的贪心算法,我之前反复抄了很多遍还是不会做,这次竟然一次性AC.
贪心
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct E{
int J;
int F;
double value; //性价比
bool operator < (const E &b)const{
return value > b.value;
}
}E[1000];
int main(){
int m,n;
while(scanf("%d%d",&m,&n) != EOF){
if(m == -1 && n == -1) break;
for(int i = 0;i < n;i++){
scanf("%d%d",&E[i].J,&E[i].F);
E[i].value = E[i].J*1.0/E[i].F;
}
sort(E,E+n);
double sum=0;
for(int i = 0;i < n;i++){
if(m > E[i].F){
sum += E[i].J;
m -= E[i].F;
}else{
sum += E[i].value * m;
break;
}
}
printf("%.3f\n",sum);
}
return 0;
}