Pagini recente » Cod sursa (job #1785059) | Cod sursa (job #2328939) | Cod sursa (job #1401460) | Cod sursa (job #243594) | Cod sursa (job #19282)
Cod sursa(job #19282)
#include <fstream.h>
int a[10005];
int main()
{
int w,n,x,y,i,max=0,j,bun;
ifstream f("energii.in");
ofstream g("energii.out");
f>>n>>w;
for (i=1;i<=n;i++)
{
f>>x>>y;
for (j=0;j<=max;j++)
{
if (a[j]!=0)
if (a[j+x]==0 || (a[j+x]!=0 && a[j]+y<a[j+x]))
{ a[j+x]=a[j]+y; }
}
if (a[x]==0 || (a[x]!=0 && a[x]>y))
a[x]=y;
max=max+x;
}
//bun=-1;
//for (i=w;i<=max;i++)
// if ((a[i]!=0 && bun==-1)||(a[i]!=0 && bun!=-1 && bun>a[i]))
// bun=a[i];
for (i=w;i<=max;i++)
if (a[i]!=0)
{ g<<a[i]<<"\n"; break; }
//g<<bun<<"\n";
f.close();
g.close();
return 0;
}