Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <cmath> #include <algorithm> #include <queue> #include <vector> using namespace std; typedef long long ll; ll dp[105][100005]; int main() { int n, W; cin >> n >> W; int sum = 0; vector<int> weights(n), values(n); for(int i = 0; i < n; i++) { cin >> weights[i] >> values[i]; sum += values[i]; } for(int i = 0; i < 105; i++) { for(int j = 0; j < 100005; j++) { dp[i][j] = 2e18; } } dp[0][0] = 0; for(int i = 0; i < n; i++) { for(int j = 0; j <= sum; j++) { dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]); if(j + values[i] <= sum) { dp[i + 1][j + values[i]] = min(dp[i + 1][j + values[i]], dp[i][j] + weights[i]); } } } for(int i = sum; i >= 0; i--) { if(dp[n][i] <= W) { cout << i << endl; break; } } return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
