POJ--3111 0/1分数规划

/**
题意：和上道题题型类似 求解k个二元组和最大并输出序号  结构体存一下就ok了;
*/

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;

const int maxn=1e6+7;
const double eps=1e-7;

int n,k,ans[maxn];

struct node {
    int id;
    double val,v,w;
}a[maxn];

bool cmp(node a,node b){
    return a.val>b.val;
}

bool judge(double x){
	for(int i=0;i<n;i++) a[i].val=a[i].v-x*a[i].w;
	sort(a,a+n,cmp);
	double sum=0;
	for(int i=0;i<k;i++) sum+=a[i].val;
    return  sum>=0.0;
}

int main (){
    scanf("%d %d",&n,&k);
    for(int i=0;i<n;i++) scanf("%lf %lf",&a[i].v,&a[i].w),a[i].id=i+1;
    double l=0,r=1.0*(0x3f3f3f3f);
    while(fabs(r-l)>eps){
        double mid=(l+r)/2;
        if(judge(mid)) l=mid;
        else r=mid;
    }
    for(int i=0;i<k;i++) printf(i==k-1?"%d\n":"%d ",a[i].id);
    return 0;
}