2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest J.Bottles(背包,好题)

最新推荐文章于 2020-04-11 20:29:08 发布

___fouzhe

最新推荐文章于 2020-04-11 20:29:08 发布

阅读量584

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/fouzhe/article/details/52917205

版权

动态规划专栏收录该内容

78 篇文章 1 订阅

订阅专栏

Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaining amount of soda ai and bottle volumebi (ai ≤ bi).

Nick has decided to pour all remaining soda into minimal number of bottles, moreover he has to do it as soon as possible. Nick spends xseconds to pour x units of soda from one bottle to another.

Nick asks you to help him to determine k — the minimal number of bottles to store all remaining soda and t — the minimal time to pour soda into k bottles. A bottle can't store more soda than its volume. All remaining soda should be saved.

Input

The first line contains positive integer n (1 ≤ n ≤ 100) — the number of bottles.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is the amount of soda remaining in the i-th bottle.

The third line contains n positive integers b1, b2, ..., bn (1 ≤ bi ≤ 100), where bi is the volume of the i-th bottle.

It is guaranteed that ai ≤ bi for any i.

Output

The only line should contain two integers k and t, where k is the minimal number of bottles that can store all the soda and t is the minimal time to pour the soda into k bottles.

   Examples 
 

     input 
   
4
3 3 4 3
4 7 6 5

     output 
   
2 6

     input 
   
2
1 1
100 100

     output 
   
1 1

     input 
   
5
10 30 5 6 24
10 41 7 8 24

     output 
   
3 11

Note

In the first example Nick can pour soda from the first bottle to the second bottle. It will take 3 seconds. After it the second bottle will contain 3 + 3 = 6 units of soda. Then he can pour soda from the fourth bottle to the second bottle and to the third bottle: one unit to the second and two units to the third. It will take 1 + 2 = 3 seconds. So, all the soda will be in two bottles and he will spend 3 + 3 = 6seconds to do it.

题意：

给出n个瓶子，第一行给出每个中液体容量，第二行给出每个的总容量，求出最少装满所有液体的瓶子数，并且将一个瓶子向另一个转移一单位液体花费时间为1，在瓶子数最少的情况下求出所花时间最小值。

题解：

看了杜教代码才知道怎么写。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
typedef long long ll;
const int MAXN=100+10;
const int INF=0x3fffffff;
int a[MAXN],b[MAXN],dp[MAXN][MAXN*MAXN],pd[MAXN][MAXN*MAXN];
//dp[k][j]为选k个瓶子总容量为j,里面装的液体的最大量 
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]);
	int sa=0,sb=0;
	dp[0][0]=0;
	for(int i=1;i<=n;i++) 
	{
		for(int j=0;j<i;j++) for(int k=0;k<=sb;k++) pd[j][k]=dp[j][k];//pd用于记录前i个的结果 
		for(int j=0;j<=i;j++) for(int k=0;k<=sb+b[i];k++) dp[j][k]=-(1<<20);
		for(int j=0;j<i;j++) for(int k=0;k<=sb;k++) {
			dp[j][k]=max(dp[j][k],pd[j][k]);
			dp[j+1][k+b[i]]=max(dp[j+1][k+b[i]],pd[j][k]+a[i]);
		}
		sa+=a[i],sb+=b[i];
	}
	int ret=0;
	for(int j=0;j<=n;j++) 
	{
		for(int k=sa;k<=sb;k++)
			ret=max(ret,dp[j][k]);
		if (ret>0) 
		{
			printf("%d %d\n",j,sa-ret);
			return 0;
		}
	}
	return 0;
}