POJ--3111 0/1分数规划

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

#include
#include
#include
#include
#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=0.0;
}

int main (){
    scanf("%d %d",&n,&k);
    for(int i=0;ieps){
        double mid=(l+r)/2;
        if(judge(mid)) l=mid;
        else r=mid;
    }
    for(int i=0;i