Cod sursa(job #3320873)
| Utilizator | Data | 7 noiembrie 2025 17:20:54 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int v[10001],n,i,p,g,k,j,sol;
int main()
{
cin>>n>>k;
for(i=1;i<=k;i++){
v[i]=-1;
}
for(i=1;i<=n;i++){
cin>>g>>p;
if(v[g]==-1 && v[g]<p) v[g]=p;
for(j=k;j>=0;j--){
if(v[j]!=-1){
v[j+g]=max(v[j+g],v[j]+p);
}
}
}
for(j=0;j<=k;j++){
sol=max(sol,v[j]);
}
cout<<sol;
return 0;
}
