TOJ 3290 Watch The Movie 二维01背包-蒲公英云

TOJ 3290 Watch The Movie 二维01背包

女爷i 2022-05-17 07:04 177阅读 0赞

3290: Watch The Movie

描述

New semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. She like watch cartoon very much. So she wants her uncle to buy some movies and watch with her tonight. Her grandfather gave them L minutes to watch the cartoon. After that they have to go to sleep.
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 of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by input data for each test case:
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.

输出

Contain one number. (It is less then 2^31.)
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

样例输出

题意：多多想看电影，输入n部电影，可看m部电影，可看时常l，之后n行，输入每部电影的时间和价值，求得在时间限制下让价值最大。

思路：价值可能有负值，所以极值要设置为-INF。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
using namespace std;
#define inf 0x3f3f3f3f
#define LL long long
//二维01背包 
int dp[110][1005],t[110],v[110];
int main()
{
    int i,j,k,n,m,l,T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&n,&m,&l);
        for(i=0;i<n;i++)
        scanf("%d%d",&t[i],&v[i]);
        for(i=0;i<=l;i++)
            dp[0][i]=0;
        for(i=1;i<=m;i++)
        {
            for(j=0;j<=l;j++)
            {
                dp[i][j]=-inf;//有可能为负值 
            }
        }
        for(i=0;i<n;i++)
        { 
            for(j=m;j>=1;j--)
            { 
                for(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]);
    }
}