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 <vector> using namespace std; long long dp[105][100005]; int main() { int n, W; cin >> n >> W; vector<int> weight(n), value(n); for(int i = 0; i < n; i++) { cin >> weight[i] >> value[i]; } for(int i = 0; i < 101; i++) { for(int j = 0; j < 100001; j++) { dp[i][j] = -1e18; } } dp[0][W] = 0; for(int i = 0; i < n; i++) { for(int w = W; w >= 0; w--) { if(w - weight[i] >= 0) { dp[i + 1][w - weight[i]] = max(dp[i + 1][w - weight[i]], dp[i][w] + value[i]); } dp[i + 1][w] = max(dp[i + 1][w], dp[i][w]); } } long long result = -1e18; for(int i = 0; i <= W; i++) { result = max(result, dp[n][i]); } cout << result << endl; 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)
