【POJ 2976】Dropping tests

最新推荐文章于 2019-10-08 14:53:44 发布

forever_dreams

最新推荐文章于 2019-10-08 14:53:44 发布

阅读量156

点赞数

分类专栏： --------基础算法-------- # 分数规划文章标签： 01分数规划

本文链接：https://blog.csdn.net/forever_dreams/article/details/83043354

版权

--------基础算法-------- 同时被 2 个专栏收录

77 篇文章 4 订阅

订阅专栏

分数规划

6 篇文章 0 订阅

订阅专栏

【题目】

传送门

Description

In a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative average is defined to be

$100\cdot \frac{\sum^{n}_{i=1}a_i}{\sum^{n}_{i=1}b_i}$

Given your test scores and a positive integer k, determine how high you can make your cumulative average if you are allowed to drop any k of your test scores.

Suppose you take 3 tests with scores of 5/5, 0/1, and 2/6. Without dropping any tests, your cumulative average is $100\cdot \frac{5+0+2}{5+1+6}=50$ . However, if you drop the third test, your cumulative average becomes $100\cdot \frac{5+0}{5+1}\approx 83.33\approx 83$ .

Input

The input test file will contain multiple test cases, each containing exactly three lines. The first line contains two integers, 1 ≤ n ≤ 1000 and 0 ≤ k < n. The second line contains n integers indicating ai for all i. The third line contains n positive integers indicating bi for all i. It is guaranteed that 0 ≤ ai ≤ bi ≤ 1, 000, 000, 000. The end-of-file is marked by a test case with n = k = 0 and should not be processed.

Output

For each test case, write a single line with the highest cumulative average possible after dropping k of the given test scores. The average should be rounded to the nearest integer.

Sample Input

3 1
5 0 2
5 1 6
4 2
1 2 7 9
5 6 7 9
0 0

Sample Output

83
100

Hint

To avoid ambiguities due to rounding errors, the judge tests have been constructed so that all answers are at least 0.001 away from a decision boundary (i.e., you can assume that the average is never 83.4997).

【分析】

大致题意：给出 $n$ 个二元组 $a_i,b_i)$ ，给定 $k$ ，可以从这 $n$ 个二元组中丢掉 $k$ 个，最后使 $a$ 元素之和比上 $b$ 元素之和最大

0/1 分数规划简单题

还是采用二分法，假设现在二分到了一个值 $m i d$ （令 $t = n - k$ ）

那么应该有 $\frac{a_1+a_2+...+a_t}{b_1+b_2+...+b_t}>=mid$

移项得 $(a_1+a_2+...+a_t)>=(b_1+b_2+...+b_t)\cdot mid$

进一步化简得 $(a_1-b_1\cdot mid)+(a_2-b_2\cdot mid)+...+(a_t-b_t\cdot mid)>=0$

到现在就很显然了吧，直接记录一下 $a_i-b_i\cdot mid$ ，排序后贪心选取最大的 $t$ 个，最后判断答案是否大于等于 $0$ 即可

【代码】

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 1005
#define eps 1e-8
using namespace std;
int n,k,a[N],b[N];
double c[N];
bool check(double mid)
{
	int i;
	double ans=0;
	for(i=1;i<=n;++i)
	  c[i]=a[i]-b[i]*mid;
	sort(c+1,c+n+1);
	for(i=n;i>k;--i)
	  ans+=c[i];
	return ans>=0;
}
int main()
{
	int i;
	while(~scanf("%d%d",&n,&k))
	{
		if(!n&&!k)  break;
		for(i=1;i<=n;++i)  scanf("%d",&a[i]);
		for(i=1;i<=n;++i)  scanf("%d",&b[i]);
		double l=0,r=1,mid;
		while(r-l>eps)
		{
			mid=(l+r)/2;
			if(check(mid))  l=mid;
			else  r=mid;
		}
		printf("%.0f\n",l*100);
	}
	return 0;
}