Cod sursa(job #2224958)
| Utilizator | Data | 25 iulie 2018 16:49:59 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,t,a[10010];
struct orice
{
int g,v;
}x;
int maxi(int c,int d)
{
if(c>d)
return c;
return d;
}
int main()
{
ifstream fin("rucsac.in");
fin>>n>>t;
for(int i=1;i<=n;i++)
{
fin>>x.g>>x.v;
for(int j=t;j>=x.g;j--)
{
a[j]=maxi(a[j],a[j-x.g]+x.v);
cout<<a[j]<<" ";
}
cout<<"\n";
}
ofstream fout("rucsac.out");
fout<<a[t];
return 0;
}
