Cod sursa(job #3318132)
| Utilizator | Data | 27 octombrie 2025 11:21:37 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main(){
int n,k;
fin>>n>>k;
vector<int>dp(k+1,0);
vector<pair<int,int>>v(n);
for(auto &x:v) fin>>x.first>>x.second;
for(int i=0;i<n;i++){
for(int j=k-v[i].first;j>=0;j--){
dp[j+v[i].first]=max(dp[j]+v[i].second,dp[j+v[i].first]);
}
}
int ans=0;
for(auto x:dp) ans=max(x,ans);
fout<<ans;
return 0;
}
