Pagini recente » Cod sursa (job #1384209) | Cod sursa (job #2059022) | Cod sursa (job #2142683) | Cod sursa (job #1675063) | Cod sursa (job #93134)
Cod sursa(job #93134)
#include <stdio.h>
#include <stdlib.h>
struct gen
{
long eg,cg;
} v[1010];
long g,w;
long sum[5010],sel[5010];
int compar(const void *a,const void *b)
{
gen c = *(gen *)a;
gen d = *(gen *)b;
if (c.eg != d.eg)
return c.eg - d.eg;
return c.cg - d.cg;
}
int main ()
{
long i,j;
freopen ("energii.in","r",stdin);
freopen ("energii.out","w",stdout);
scanf("%ld",&g);
scanf("%ld",&w);
for (i = 1;i <= g; ++i)
{
scanf("%ld %ld",&v[i].eg,&v[i].cg);
}
qsort(v,g,sizeof(gen),compar);
for (i = 1;i <= w; ++i)
sum[i] = 2000000000;
sum[0] = 0;
sel[0] = 1;
for (i = 1;i <= g; ++i)
for (j = w;j >= 0; --j)
if (sel[j] && sum[j + v[i].eg] > sum[j] + v[i].cg && j+v[i].eg<= w)
{
sum[j + v[i].eg] = sum[j] + v[i].cg;
sel[j + v[i].eg] = 1;
}
printf ("%ld",sum[w]);
return 0;
}