团体程序设计天梯赛-练习集 L2-003. 月饼LOVE

#include<iostream>
#include<cstdio>
using namespace std;
const int MAX = 1010;
struct Moon {
double t;
double money;
double moneymax;
}moon[MAX];
int cmp(const void *a, const void *b) {
return (*(Moon*)a).money > (*(Moon*)b).money ? -1 : 1;
}
int main() {
int n;
double tmax;
scanf("%d%lf", &n, &tmax);
double ans=0;
for (int i = 0; i < n; i++) {
scanf("%lf", &moon[i].t);
}
for (int i = 0; i < n; i++) {
scanf("%lf", &moon[i].moneymax);
moon[i].money = moon[i].moneymax / moon[i].t;
}
qsort(moon, n, sizeof(moon[0]), cmp);
for (int i = 0; i < n&&tmax>0; i++) {
if (moon[i].t < tmax) {
ans += moon[i].moneymax;
tmax -= moon[i].t;
}
else {
ans += moon[i].money*tmax;
tmax = 0;
}
}
printf("%.2lf\n", ans);
return 0;
}