Cod sursa(job #2127253)
Utilizator | Data | 10 februarie 2018 15:03:14 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,w,p,x[1000004],i,j,sol;
int main()
{
fin>>n>>G;
for(i=1;i<=n;i++)
{
fin>>w>>p;
for(j=G-w;j>=0;j--)
{
if(x[j+w]<x[j]+p)
{
x[j+w]=x[j]+p;
if(x[j+w]>sol)
{
sol=x[j+w];
}
}
}
}
fout<<sol;
return 0;
}