提出 #45912976

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define LL long long
#define DB double
#define MOD 1000000007
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) ((-x) & x)
#define MP make_pair
#define VI vector<int>
#define VL vector<LL>
#define VII VI::iterator
#define VLI VL::iterator
#define all(x) x.begin(), x.end()
#define EB emplace_back
#define PII pair<int, int>
#define SI set<int>
#define SII SI::iterator
#define fi first
#define se second
using namespace std;
template<typename T> void chkmn(T &a, const T &b) { (a > b) && (a = b); }
template<typename T> void chkmx(T &a, const T &b) { (a < b) && (a = b); }
void Inc(int &a, const int &b) { ((a += b) >= MOD) && (a -= MOD); }
void Dec(int &a, const int &b) { ((a -= b) < 0) && (a += MOD); }
void Mul(int &a, const int &b) { a = 1LL * a * b % MOD; }
void Sqr(int &a) { a = 1LL * a * a % MOD; }
int inc(const int &a, const int &b) { return (a + b >= MOD) ? a + b - MOD : a + b; }
int dec(const int &a, const int &b) { return (a - b < 0) ? a - b + MOD : a - b; }
int mul(const int &a, const int &b) { return 1LL * a * b % MOD; }
int sqr(const int &a) { return 1LL * a * a % MOD; }
int qwqmi(int x, int k = MOD - 2)
{
	int res = 1;
	while(k)
	{
		if(k & 1) Mul(res, x);
		k >>= 1, Sqr(x);
	}
	return res;
}
const int N = 105;
const int M = 1e5 + 5;
const LL INF = 1e18;
int n, v[N];
LL W, w[N]; 
LL f[M];
int main()
{
	cin >> n >> W;
	for(int i = 1; i < M; ++i)
		f[i] = INF;
	f[0] = 0;
	for(int i = 1; i <= n; ++i)
	{
		cin >> w[i] >> v[i];
		for(int j = M - 1; j >= v[i]; --j)
			chkmn(f[j], f[j - v[i]] + w[i]);
	}
	for(int i = M - 1; i >= 0; --i)
		if(f[i] <= W) 
		{
			printf("%d\n", i);
			return 0;
		}
	return 0;
}

提出情報

ジャッジ結果