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; int dp[1005][100005]; int main() { int n; cin>>n; int price; cin>>price; vector<int>a; // price vector<int>b; //broj na strani for(int i=0; i<n; i++){ int a1; cin>>a1; a.push_back(a1); } for(int i=0; i<n; i++){ int b1; cin>>b1; b.push_back(b1); } for(int i=0; i<=n; i++){ for(int j=0; j<=price; j++){ dp[i][j]=-1; } } dp[0][0]=0; int result=0; for(int i=0; i<n; i++){ for(int j=0; j<=price; j++){ if(j+a[i]<=price){ dp[i+1][j+a[i]]=max(dp[i+1][j+a[i]], dp[i][j]+b[i]); } dp[i+1][j]=max(dp[i+1][j], dp[i][j]); } } for(int i=0; i<=price; i++){ result=max(result, dp[n][i]); } cout<<result; 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)
