牛客2018多校第五场A(01分数规划)

链接：https://www.nowcoder.com/acm/contest/143/A
来源：牛客网
 

Kanade selected n courses in the university. The academic credit of the i-th course is s[i] and the score of the i-th course is c[i].

At the university where she attended, the final score of her is 

Now she can delete at most k courses and she want to know what the highest final score that can get.

输入描述:

The first line has two positive integers n,k

The second line has n positive integers s[i]

The third line has n positive integers c[i]

输出描述:

Output the highest final score, your answer is correct if and only if the absolute error with the standard answer is no more than 10-5

示例1

输入

复制

3 1
1 2 3
3 2 1

输出

复制

2.33333333333

说明

Delete the third course and the final score is 

备注:

1≤ n≤ 105

0≤ k < n

1≤ s[i],c[i] ≤ 103

题意，给两个序列s和c, 删除K个数使最大，我们可以设=R,转化后就为Rsigma(s[i])=sigma(s[i]c[i]);移项之后为F(R) = sigma(Rs[i]-s[i]c[i]),令s[i]c[i] = b[i],则F(R) = sigma(Rs[i]-b[i]) F(R) 是递减的，二分答案，只要F(R)大于0， 就可以增大。

代码如下：

#include<stdio.h>
#include<iostream>
#include<iomanip>
#include<algorithm>
#define eps 1e-10
using namespace std;
const int maxn = 1e5 + 10;
double s[maxn], c[maxn], b[maxn], w[maxn];
int n, k;
bool is(double x)
{
    for(int i = 1; i <= n; i++)
    {
        w[i] = b[i]-x*s[i];
    }
    sort(w+1, w+n+1);
    double ans = 0;
    for(int i = n; i > k; i--)
    {
        ans += w[i];
    }
    if(ans >= 0) return true;
    return false;
}
int main()
{
    ios::sync_with_stdio(false);
    cin >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        cin >> s[i];
    }
    for(int i = 1; i <= n; i++)
    {
        cin >> c[i];
        b[i] = s[i]*c[i];
    }
    double l = 0.0, r = 100000.0;
    while(r-l > eps)
    {
        double mid = (r+l)/2;
        if(is(mid))
        {
            l = mid;
        }
        else
        {
            r = mid;
        }
    }
    cout << setiosflags(ios::fixed) << setprecision(8) << l << endl;
    return 0;
}