CodeForces - 730J （2020.5.14训练J题）

Problem
Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaining amount of soda a i and bottle volume bi( 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 x seconds 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 a 1, a 2, …, a n (1 ≤ a i ≤ 100), where a i is the amount of soda remaining in the i-th bottle.
The third line contains n positive integers b 1, b 2, …, b n (1 ≤ b i ≤ 100), where b i is the volume of the i-th bottle.
It is guaranteed that a i ≤ b i 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.

题意：有n个瓶子，每个瓶子有两个值，容积值和剩余水量，从一个瓶子倒x单位的水进另一个瓶子需要花x单位时间，现在要求输出两个数，第一个数是能装下所有剩余的最小瓶数，第二个数是装进k个瓶子所要花的最短时间（注意不一定是前面那k个瓶子哦）

用个结构体存下数据，按容积大小排个序，先把k的值弄出来，然后题目就转化成了n个物品中取k个剩余量和最多，这样转移进这k个花时就最短，这就可以联系到01背包，要多加个循环，代表取了多少个

AC代码

#include<iostream>
#include<algorithm>
using namespace std;
const int inf = -999999;
struct bottle
{
   
	int r;
	int v;