algorithmStudy/14728.cpp at master · judy5050/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//
//  14728.cpp
//  algo
//
//  Created by 박효정 on 2021/02/08.
//

#include <iostream>
#include <algorithm>


using namespace std;

int n,t;
int k[1000],s[1000];
int dp[101][10001];
int go(int i,int w){

    if(dp[i][w]>0) return dp[i][w];
    if(i==n) return 0;
    int n1=0;
    if(w+k[i]<=t){
        n1=s[i]+go(i+1,w+k[i]);

    }
    int n2=go(i+1,w);

    dp[i][w]=max(n1,n2);
    cout<<"dp[i][w] = "<<"i = "<<i<<"w = "<<w <<" " <<dp[i][w]<<"\n";
    return dp[i][w];

}


int main()
{


    cin>>n>>t;
    for(int i=0;i<n;i++){
        cin>>k[i]>>s[i];
    }

    cout<<go(0,0)<<"\n";


    return 0;
}