Cod sursa(job #3330457)
| Utilizator | Data | 19 decembrie 2025 17:12:38 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
#define MAXN 5005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, k, w[MAXN], p[MAXN], ans=0, sum=0, val=0;
void bkt(int i);
int main()
{
fin>>n>>k;
for (int i=1; i<=n; i++) {
fin>>w[i]>>p[i];
}
bkt(1);
fout<<ans;
return 0;
}
void bkt(int i) {
if (sum>k) return ;
if (i>n) {
ans=max(ans, val);
return ;
}
sum+=w[i];
val+=p[i];
bkt(i+1);
sum-=w[i];
val-=p[i];
bkt(i+1);
}
