poj 3111

这道题目跟2976差不多，也是二分那个最大的值，然后化成计算式，排序以后得到一个数组，取最大的前k个，然后记录结果，继续二分即可。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 210
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
struct Node{
    int id;
    int v,w;
    double cost;
    bool operator<(const Node &x)const{
        return cost>x.cost;
    }
}a[100010];
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
#endif
    while(sfd(n,m)!=EOF){
        for(int i=0;i<n;i++){
            scanf("%d%d",&a[i].v,&a[i].w);
            a[i].id=i+1;
        }
        double l=0,r=INF;
        vector<int> v;
        while(r-l>eps){
            double mid = (l+r)/2;
            for(int i=0;i<n;i++)
                a[i].cost = a[i].v-mid*a[i].w;
            sort(a,a+n);
            double ans=0;
            for(int i=0;i<m;i++)    //取最大的前m个
                ans += a[i].cost;
            if(ans>0){
                l = mid;
            }else{
                r = mid;
                v.clear();
                for(int i=0;i<m;i++) v.push_back(a[i].id);//记录结果
            }
        }
        int size = (int)v.size();
        for(int i=0;i<size;i++)
            printf("%d%c",v[i],i+1==size?'\n':' ');
    }
    return 0;
}