Pagini recente » Cod sursa (job #2752155) | Cod sursa (job #2391411) | Cod sursa (job #311171) | Cod sursa (job #1043327) | Cod sursa (job #767326)
Cod sursa(job #767326)
#include<stdio.h>
#define WMAX 10002
int a[ WMAX ], n, W, max;
void solve()
{
int i, j, w, p;
FILE *f = fopen("rucsac.in", "r");
fscanf(f, "%d %d", &n, &W);
for(i = 1; i <= n; i++)
{
fscanf(f, "%d %d", &w, &p);
for(j = W - w; j >= 0; j--)
if(a[j + w] < a[j] + p)
{
a[j + w] = a[j] + p;
if(a[j + w] > max)
max = a[j + w];
}
}
}
void write()
{
FILE *g = fopen("rucsac.out", "w");
fprintf(g, "%d\n", max);
fclose(g);
}
int main()
{
solve();
write();
return 0;
}