类型:分数规划
题目:给你n次测试,对于测试i,总分为bi,你可以得到ai的分数,现让你除去某些测试使得剩下的平均分数最大
来源: Stanford Local 2005思路:假设当前猜测值为ans(0 <= ans <= 1),构造函数,fi = bi * ans - ai,如果存在要求数量的fi的和使得
∑fi < 0,则说明∑(bi * ans) < ∑ai,即∑ai / ∑ bi > ans,则ans太小,二分答案即可
// poj 2976 Dropping tests
// ac 196K 63MS
#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
#define FORE(i, a, b) for(i = (a); i <= (b); ++(i))
#define MAXN 1010
#define EPS 0.0001
#define INF 0x7f7f7f7f
int n, k;
int a[MAXN], b[MAXN];
double tmp[MAXN];
int main() {
int i;
while(scanf("%d %d", &n, &k) == 2, n || k) {
FORE(i, 1, n)
scanf("%d", &a[i]);
FORE(i, 1, n)
scanf("%d", &b[i]);
double l = 0.0, r = 1.0, mid;
while(r - l > EPS) {
mid = (r + l) / 2.0;
FORE(i, 1, n)
tmp[i] = (double)b[i] * mid - (double)a[i];
sort(tmp + 1, tmp + n + 1);
double sum = 0.0;
FORE(i, 1, n - k)
sum += tmp[i];
(sum < 0) ? l = mid : r = mid;
}
printf("%d\n", (int)((mid + 0.005)* 100));
}
return 0;
}