POJ 3111 - K Best(二分搜索)

题目:

http://poj.org/problem?id=3111

题意:

给出n个物品的v,w, 从中选出k个物品使得单位重量价值最大,输出方案.

思路:

二分,搜索最大化平均值.

需要注意的是当二分搜索跳出循环时, 此时的cnt数组不一定是最终答案,应该将l 重新带入在输出答案. (在这个地方wa了很久.

CODE:

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
const double esp = 1e-9;
const int maxn = 100005;
struct node {
    int v, w;
}num[maxn];
struct Tmp {
    double y;
    int id;
    bool operator < (const Tmp & X) const{
        return y > X.y;
    }
}cnt[maxn];
int ans[maxn];
int n, k;

bool cmp(Tmp a, Tmp b)
{
    return a.id < b.id;
}
bool can(double x)
{
    for(int i = 0; i < n; ++i) {
        cnt[i].y = num[i].v - x * num[i].w;
        cnt[i].id = i + 1;
    }
    sort(cnt, cnt + n);
    double sum = 0;
    for(int i = 0; i < k; ++i) {
        sum += cnt[i].y;
    }
    return sum >= 0;
}
void solve(double s)
{
    double l = 0, r = s;
    while(r - l > esp) {
        double mid = (r + l) / 2;
        if(can(mid)) l = mid;
        else r = mid;
    }
    if(can(l)) {
        printf("%d", cnt[0].id);
        for(int i = 1; i < k; ++i) {
            printf(" %d", cnt[i].id);
        }
        printf("\n");
    }
}
int main()
{
//freopen("in", "r", stdin);
    while(~scanf("%d %d", &n, &k)) {
        double max_s = 0;
        for(int i = 0; i < n; ++i) {
            scanf("%d %d", &num[i].v, &num[i].w);
            max_s = max(max_s, (double)num[i].v/num[i].w);
        }

        solve(max_s);
    }
    return 0;
}