Gu Jian Qi Tan is a very hot Chinese RPG in this summer vacation. SuSu is the most important role in the game. When SuSu first meet the ancient dragon QianYu, he will have a very difficult battle with QianYu. In order to resist QianYu's powerful attack, SuSu must make a special armor, which needs some precious materials ( We call it "Ice Heart" ).
Before this legend fight, SuSu must pass M dangerous labyrinth in order. In each labyrinth, there is a very powerful monster (We usually call it "BOSS") keeping watching the exit. So SuSu must defeat each BOSS if he wants to leave each labyrinth. When SuSu is fighting with a BOSS, he must attack its main body to kill it. however, some BOSS may have one or more special position of its body (such as wings, hands, weapons). SuSu can choose to attack these special positions and he will get one Ice Heart if he break the defence of one special position. Of course SuSu can choose not to attack special positions but just attack the BOSS's main body (in this situation, he can still kill the BOSS, but he cannot get Ice Heart).
The defence of all special positions are so strong that normal attack are not available. SuSu must use magic skill to attack it. Once he uses a magic skill, his mana point will decrease to 0. In order to recover mana point, he can eat a special food "Dan Gui Hua Gao" (a kind of cake).
In each labyrinth, SuSu can collect some cakes by killing small monsters. When he fights with a BOSS, his initial mana point will be 0. Different BOSS may have different amount of special positions, and the defence of different position may also be different ( that is, some positions may need just one magic attack but some may need to be attacked many times )
Notice: cakes in previous labyrinth can be accumulated and brought to later labyrinth.
Can you tell how many Ice heart can SuSu get at most?
Input
The first line of the input is a single integer T (T <= 20) indicating the number of test cases.
In each case, fisrt there is a line containing one integer M ( M <= 1000) indicating the number of labyrinth.
Then M lines follow. In the ith line, first there is an integer n (n <= 1000) indicating the amount of special positions this BOSS has.
Then followd by n integers, the ith integer ( no more than 20 ) indicating the amount of magic attacks SuSu must use to break the ith special position.
Finally there is a line containing M integers, the ith integer ( no more than 20 ) indicating how many cakes SuSu can collect in the ith labyrinth.
Output
For each case, output one line, containing the maximum number of Ice Heart SuSu can get.
Sample Input
1 2 1 10 2 1 2 10 0
Sample Output
2
Author: HUANG, Qiao
Contest: ZOJ Monthly, November 2010
方法一
解法：贪心。对于一个ice heart，如果当前cake数大于或等于该ice heart的消耗，则直接取得，如果不，则用前面消耗的最大cake的与当前ice heart比较，当前ice heart消耗小些，则交换，赚一点cake，否则不换。用一个最大堆维护即可。
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int M,n,i,j,t,T;
int k,temp;
scanf("%d",&T);
while(T--)
{
scanf("%d",&M);
vector<int> a[1003];
priority_queue<int> Q;
for(i=0;i<M;i++)
{
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&t),a[i].push_back(t);
}
for(temp=k=i=0;i<M;i++)
{
scanf("%d",&t);
temp+=t;
for(j=0;j<a[i].size();j++)
{
if(a[i][j]<=temp)
{
Q.push(a[i][j]);
k++;temp-=a[i][j];
}
else
{
if(!Q.empty()&&Q.top()>a[i][j])
{ temp+=(Q.top()-a[i][j]);
Q.pop();
Q.push(a[i][j]);
}
}
}
}
printf("%d\n",k);
}
return 0;
}
方法二
走到一个迷宫后，尽可能地占下所有的ice heart，如果占下某个ice heart时将当前积累的Cake消耗成了负数，则放弃之前取得的一个消耗Cake最大的ice heart。
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int M,n,i,j,t,T;
int k,temp;
scanf("%d",&T);
while(T--)
{
scanf("%d",&M);
vector<int> a[1003];
priority_queue<int> Q;
for(i=0;i<M;i++)
{
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&t),a[i].push_back(t);
}
for(temp=k=i=0;i<M;i++)
{
scanf("%d",&t);
temp+=t;
for(j=0;j<a[i].size();j++)
{
Q.push(a[i][j]);
temp-=a[i][j];
k++;
}
while(temp<0)
{
temp+=Q.top();
Q.pop();
k--;
}
}
printf("%d\n",k);
}
return 0;
}