Cod sursa(job #3232601)
| Utilizator | Data | 31 mai 2024 09:37:07 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream F("rucsac.in");
ofstream G("rucsac.out");
#define Z 2048
int a[10001],i,n,j,k,p=Z,g;
char s[Z];
inline char A()
{
if(p==Z)
F.read(s,Z),p=0;
return s[p++];
}
int B()
{
int n=0;
char c;
for(c=A();isdigit(c);n=n*10+c-48,c=A());
return n;
}
int main()
{
for(n=B(),g=B();n--;)
for(i=B(),j=B(),k=g;k>=i;a[k]=max(a[k],j+a[k-i]),--k);
return G<<a[g],0;
}
