Cod sursa(job #2034683)
Utilizator | Data | 8 octombrie 2017 12:17:15 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, nr, a[10005], i, j, x1, x2;
int main()
{
f>>n>>nr;
a[0]=1;
for(i=0;i<n;i++)
{
f>>x1>>x2;
for(j=nr-x1;j>=0;j--)
{
if(a[j]+x2>a[j+x1])
a[j+x1]=a[j]+x2;
}
}
x2=0;
for(i=0;i<=nr;i++)
{
if(a[i]>x2)
x2=a[i];
}
g<<x2-1;
return 0;
}