F - K Best POJ - 3111(01分数规划)

Demy has n jewels. Each of her jewels has some value vi and weight wi.

Since her husband John got broke after recent financial crises, Demy has decided to sell some jewels. She has decided that she would keep k best jewels for herself. She decided to keep such jewels that their specific value is as large as possible. That is, denote the specific value of some set of jewels S = {i1, i2, …, ik} as

.

Demy would like to select such k jewels that their specific value is maximal possible. Help her to do so.

Input

The first line of the input file contains n — the number of jewels Demy got, and k— the number of jewels she would like to keep (1 ≤ k ≤ n ≤ 100 000).

The following n lines contain two integer numbers each — vi and wi (0 ≤ vi ≤ 106, 1 ≤ wi ≤ 106, both the sum of all vi and the sum of all wi do not exceed 107).

Output

Output k numbers — the numbers of jewels Demy must keep. If there are several solutions, output any one.

Sample Input

3 2
1 1
1 2
1 3

Sample Output

1 2

这道题和上一道POJ2976 hin相似，这次是挑选k个，来达到表达式的值最大，输出所选的数的编号。

这道二分出来却不对，看讨论区说二分需注意。。

确的写法：
void solve()
{
    double left = 0.0;
    double right = 0.0;
    for (int i = 0; i < N; i++)
        right = max(right, 1.0 * value[i] / weight[i]);

    while (1)
    {
        double mid = (left + right) / 2.0;
        for (int i = 0; i < N; i++)
        {
            item[i].idx = i + 1;
            item[i].prior = value[i] - mid * weight[i];
        }
        sort(item, item + N);

        double sum = 0.0;
        for (int i = 0; i < K; i++)
            sum += item[N - K + i].prior;

        if (sum >= 0.0)
        {
            left = mid;
            if (right - left < 1e-7)
                break; //跳出二分时需要保证运行结果是可行解
        }
        else
            right = mid;
    }

    sort(item + N - K, item + N, cmpIdx);

    for (int i = 0; i < K; i++)
        printf("%d ", item[N - K + i].idx);
}

错误的写法：
（跳出二分时，item数组中存储的可能不是可行解）
void solve()
{
    double left = 0.0;
    double right = 0.0;
    for (int i = 0; i < N; i++)
        right = max(right, 1.0 * value[i] / weight[i]);

    while (right - left >= 1e-7)
    {
        double mid = (left + right) / 2.0;
        for (int i = 0; i < N; i++)
        {
            item[i].idx = i + 1;
            item[i].prior = value[i] - mid * weight[i];
        }
        sort(item, item + N);

        double sum = 0.0;
        for (int i = 0; i < K; i++)
            sum += item[N - K + i].prior;

        if (sum >= 0.0)
            left = mid;
        else
            right = mid;
    }

    sort(item + N - K, item + N, cmpIdx);

    for (int i = 0; i < K; i++)
        printf("%d ", item[N - K + i].idx);

于是·修改·了自己原来的代码吧l取0.0.不然会超时。

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include<vector>
#include<iostream>
#define ll long long
#define inf 0x3f3f3f3f
const double esp=1e-7;
const int maxn=100010;
using namespace std;
struct node
{
    int id;
    double val;
}d[maxn];
int cmp(node p1,node p2)
{
    return p1.val<p2.val;
}
double a[maxn],b[maxn];
int n,k;
double check(double x)
{
    for(int i=0;i<n;i++)
    {
        d[i].id=i;
        d[i].val=a[i]-x*b[i];
    }
    sort(d,d+n,cmp);
    double sum=0;
    for(int i=n-1;i>=n-k;i--)
    sum+=d[i].val;
    return sum;
}
int main()
{
    while(~scanf("%d%d",&n,&k))
    {
        double l=0.0,r=0.0;
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf",&a[i],&b[i]);
//            l=min(l,a[i]/b[i]);
            r=max(r,a[i]/b[i]);
        }
        while(1)
        {
            double mid=(l+r)/2;
            if(check(mid)>=0.0)
            {
                l=mid;
                if(r-l<esp) break;
            }
            else r=mid;
        }
        printf("%d",d[n-1].id+1);
        for(int i=n-2;i>=n-k;i--)
            printf(" %d",d[i].id+1);
        printf("\n");
    }
}