Submission #16489154

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;

#define fi first
#define se second

const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);

void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}

int N, W;
ll w[105], v[105];
ll DP[105][int(1e5+5)];

int main(){
  cin >> N >> W;
  for (int i = 1; i <= N; i++){
    cin >> w[i] >> v[i];
  }

  fill((ll*)DP, (ll*)(DP + N + 1), 1e18);
  DP[0][0] = 0;

  for (int i = 1; i <= N; i++){
    for (int j = 0; j <= int(1e5); j++){
      DP[i][j] = DP[i-1][j];
    }
    for (int j = 0; j + v[i] <= int(1e5); j++){
      DP[i][j+v[i]] = min(DP[i][j+v[i]], DP[i-1][j] + w[i]);
    }
  }

  for (int j = 1e5; j >= 0; j--){
    if (DP[N][j] <= W){
      cout << j << endl;
      return 0;
    }
  }

  return 0;
}

Submission Info

Judge Result