0-1分数规划

题目描述

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

输入

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

参考：https://blog.csdn.net/hzoi_ztx/article/details/54898323

代码：//分数规划模板题

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define LL long long
using namespace std;
const int maxn=100005;
int s[maxn],c[maxn];
int n,k;
double a[maxn],l,r=1e3,mid;
bool check(double x){
	for(int i=1;i<=n;i++){
		a[i]=1.0*s[i]*c[i]-x*s[i];
	}
	sort(a+1,a+n+1);
	double sum=0;
	for(int i=k+1;i<=n;i++)
		sum+=a[i];
	return sum>0;
}
int main(){
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
		scanf("%d",&s[i]);
	for(int i=1;i<=n;i++)
		scanf("%d",&c[i]);
	while(r-l>1e-8){
		mid=(l+r)*0.5;
		if(check(mid)) l=mid;
		else r=mid;
	} 
	printf("%.11lf\n",r);
    return 0;
}