MR CODER

111

POJ 3111(二分查找平均值)

Time Limit: 8000MS   Memory Limit: 65536KB   64bit IO Format: %lld & %llu

 Status

Description

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 = {i1i2, …, 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

注意二分的原理

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 100010;
typedef long long LL;
const double inf = 100000000;
struct node1
{
    int v, w;


}p[N];


struct node2
{
    double y;
    int index;


}q[N];


int judge(double x);
int cmp(node2 a,node2 b)
{
    return a.y>b.y;
}
int n, m;


int main()
{


    while(scanf("%d %d", &n, &m)!=EOF)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d %d", &p[i].v, &p[i].w);
        }
        double l=0, r=inf;
        for(int i=0;i<=50;i++)
        {
            double mid=(l+r)/2;
            if(judge(mid))
            {
                l=mid;
            }
            else
            {
                r=mid;
            }
        }
        for(int i=0;i<m;i++)
        {
            printf("%d%c",q[i].index+1,i==m-1?'\n':' ');
        }
    }
    return 0;
}


int judge(double x)
{
    for(int i=0;i<n;i++)
    {
        q[i].index=i;
        q[i].y=p[i].v-p[i].w*x;
    }
    sort(q,q+n,cmp);
    double sum=0;
    for(int i=0;i<m;i++)
    {
        sum+=q[i].y;
    }
   return sum>=0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/yjf3151731373/article/details/52373212
个人分类: 二分搜索
上一篇POJ 3045(递推找规律)
下一篇POJ 3579(二分查找差值中间值)
想对作者说点什么? 我来说一句

poj模拟题(二分查找)

2014年07月22日 420KB 下载

poj 1064 代码

2011年12月10日 876B 下载

没有更多推荐了,返回首页

关闭
关闭