01分数规划

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≤ n≤ 105

0≤ k < n

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

示例1

输入

3 1
1 2 3
3 2 1

输出

2.33333333333

说明

Delete the third course and the final score is 

牛客题目，公式变换后二分。

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int s[100050],c[100050];
double d[100050];
int main()
{
    int n,k;
    scanf("%d %d",&n,&k);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&s[i]);
    }
    for(int i=0; i<n; i++)
    {
        scanf("%d",&c[i]);
        c[i]*=s[i];
    }
    double l=1,r=1000.0,mid;
    while(r-l>0.00000001)
    {
        mid=(l+r)/2;
        for(int i=0; i<n; i++)
        {
            d[i]=mid*s[i]-c[i];
        }
        sort(d,d+n);
        double tmp=0;
        for(int i=0; i<n-k; i++)
        {
            tmp+=d[i];
        }
        if(tmp>0)
        {
            r=mid;
        }
        else
        {
            l=mid;
        }
    }
    printf("%lf\n",l);
    return 0;
}