Watch The Movie
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 6259 Accepted Submission(s): 1992
DuoDuo list N piece of movies from 1 to N. All of them are her favorite, and she wants her uncle buy for her. She give a value Vi (Vi > 0) of the N piece of movies. The higher value a movie gets shows that DuoDuo likes it more. Each movie has a time Ti to play over. If a movie DuoDuo choice to watch she won’t stop until it goes to end.
But there is a strange problem, the shop just sell M piece of movies (not less or more then), It is difficult for her uncle to make the decision. How to select M piece of movies from N piece of DVDs that DuoDuo want to get the highest value and the time they cost not more then L.
How clever you are! Please help DuoDuo’s uncle.
The first line is: N(N <= 100),M(M<=N),L(L <= 1000)
N: the number of DVD that DuoDuo want buy.
M: the number of DVD that the shop can sale.
L: the longest time that her grandfather allowed to watch.
The second line to N+1 line, each line contain two numbers. The first number is the time of the ith DVD, and the second number is the value of ith DVD that DuoDuo rated.
The total value that DuoDuo can get tonight.
If DuoDuo can’t watch all of the movies that her uncle had bought for her, please output 0.
1 3 2 10 11 100 1 2 9 1
3
#include<cstdio>
#include<algorithm>
#include<string.h>
#define inf 99999999
using namespace std;
int T[105],V[105],dp[105][105];
int main()
{
int test,N,M,L;
scanf("%d",&test);
while(test--){
scanf("%d%d%d",&N,&M,&L);
for(int i=0;i<N;i++)scanf("%d%d",&T[i],&V[i]);
for(int i=0;i<=M;i++)
for(int j=0;j<=L;j++) {
if(i==0)
dp[i][j]=0;
else
dp[i][j]=-inf; //注意初始化为负无穷,价值可能是负值
}
for(int i=0;i<N;i++)
for(int j=M;j>=1;j--)
for(int k=L;k>=T[i];k--){
dp[j][k]=max(dp[j][k],dp[j-1][k-T[i]]+V[i]);
}
if(dp[M][L]<0)dp[M][L]==0;
printf("%d\n",dp[M][L]);
}
return 0;
}