题意:有n个珠宝,每个珠宝都有价值v和重量w,要保留k个珠宝,使得式子
中的s最大,求出s。
题解:想不出做法,网上一位童鞋的题解写的比较明白,http://m.blog.csdn.net/blog/yew1eb/38730447
#include <stdio.h>
#include <algorithm>
using namespace std;
const int N = 100005;
int n, k;
struct Jew {
int v, w, id;
double x;
}jew[N];
bool cmp(Jew a, Jew b) {
return a.x > b.x;
}
bool judge(double s) {
for (int i = 1; i <= n; i++)
jew[i].x = jew[i].v - jew[i].w * s;
sort(jew + 1, jew + 1 + n, cmp);
double temp = 0;
for (int i = 1; i <= k; i++)
temp += jew[i].x;
return temp >= 0;
}
int main() {
while (scanf("%d%d", &n, &k) == 2) {
for (int i = 1; i <= n; i++) {
scanf("%d%d", &jew[i].v, &jew[i].w);
jew[i].id = i;
}
double l = 0, r = 1000005;
for (int i = 0; i < 100; i++) {
double mid = (l + r) / 2;
if (judge(mid))
l = mid;
else
r = mid;
}
printf("%d", jew[1].id);
for (int i = 2; i <= k; i++)
printf(" %d", jew[i].id);
printf("\n");
}
return 0;
}