Revise paste Untitled

#include <iostream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
using namespace  std;
int n, w;
typedef long long ll;
ll memo[105][100005];
ll weight[105];
ll value [105];
ll ks(int i,int value_left){
    if(value_left == 0 ){
        return  0;
    }
    if(i == n ){
        return  2e18;
    }
    if(memo[i][value_left] != -1){
        return  memo[i][value_left];
    }
    ll  result = 2e18;

result = min(result,ks(i+1,value_left));
        if(value_left - value[i] >= 0){
            result = min(result, ks(i+1,value_left -value[i]) + weight[i]);
        }

return  memo[i][value_left]= result;
}
int main() {

cin >> n >> w;
    for (int i = 0; i < n; i++) {
        cin >> weight[i] >> value [i];
    }
    for (int i = 0; i < 105; i++) {
        for (int j = 0; j < 100005; j++) {
            memo[i][j] = -1;
        }
    }
    ll rez = 0;
    for (int i = 0; i < 100005; i++) {
        if(ks(0,i) <= w){
            rez = i;
        }
    }
    cout << rez;
}