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
#include <iostream>
#include <vector>


using namespace std;

int main(){
    int N,M;
    scanf("%d %d", &N, &M);
    
    vector<int> memory(N+1);
    for(int i = 1; i<=N; i++){
        scanf("%d", &memory[i]);
    }
    
    vector<int> cost(N+1);
    for(int i = 1; i<=N; i++){
        scanf("%d", &cost[i]);
    }
        
    int sum = 0;
    for(int i = 1 ; i<=N; i++){
        sum += cost[i];
    }
    
    vector<vector<int>> dp(N+1, vector<int>(N*100+1));
    
    for(int i = 1; i<=N; i++){
        for(int j = 0; j<=sum; j++){
            if(j-cost[i] >= 0){
                dp[i][j] = max(dp[i][j], dp[i-1][j-cost[i]] + memory[i]);
            }
            dp[i][j] = max(dp[i][j], dp[i-1][j]);
            
        }
    }
    
    
    for(int i = 0; i<=sum; i++){
        if(dp[N][i] >= M){
            printf("%d\n", i);
            break;
        }
        
    }
    
    
    return 0;
}