HDU3496 Watch The Movie 二维01背包

题目链接

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.
Input
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.
Output
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.
Sample Input
1
3 2 10
11 100
1 2
9 1
Sample Output
3

题目大意：
N张电影票，只能买M张，最多看L小时，每场电影都有一定的花费和价值，问买的M张电影票，最大的价值是多少，如果不能买M张的话，就输出0

二维01背包模板题了

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstring>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define rep(i,a,b) for(int i=a;i<=b;i++)
typedef long long ll;
using namespace std;
const int N=1e5+10;
const int INF=0x3f3f3f3f;
int dp[1100][1100];
int m[400],l[400];
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif // ONLINE_JUDGE
    int T;
    scanf("%d",&T);
    while(T--){
        int n,M,L;
        scanf("%d%d%d",&n,&M,&L);
        memset(dp,-1,sizeof dp);
        rep(i,1,n) scanf("%d%d",&l[i],&m[i]);

        rep(i,0,L)
        dp[0][i]=0;
        rep(i,1,n){
            for(int j=M;j>=1;j--){
                for(int k=L;k>=l[i];k--)//这两层循环的位置不能变
                if(dp[j-1][k-l[i]]!=-1)
                    dp[j][k]=max(dp[j][k],dp[j-1][k-l[i]]+m[i]);
            }
        }
       if(dp[M][L]==-1) printf("0\n");
        else
       printf("%d\n",dp[M][L]);
    }
    return 0;
}