Cod sursa(job #1996211)
Utilizator | Data | 30 iunie 2017 15:58:10 | |
---|---|---|---|
Problema | Energii | Scor | 45 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n,t,e[1001],c[1001],d[10001],i,j,maxim,s,minim=9999999;
int main()
{
f>>n;
f>>t;
for(i=1;i<=n;i++)
{
f>>e[i]>>c[i];
s=s+e[i];
}
if(s<t)
{
g<<-1;
}
else
{
d[0]=1;
for(i=1;i<=n;i++)
{
for(j=maxim;j>=0;j--)
{
if(d[j]!=0)
{
if(d[j+e[i]]==0)
{
if(j==0)
{
d[j+e[i]]=c[i];
}
else
{
d[j+e[i]]=d[j]+c[i];
}
}
else
{
if(j==0)
{
if(d[j+e[i]]>c[i])
{
d[j+e[i]]=c[i];
}
}
else
{
if(d[j]+c[i]<d[j+e[i]])
{
d[j+e[i]]=d[j]+c[i];
}
}
}
if(j+e[i]>maxim && j+e[i]<10002)
{
maxim=j+e[i];
}
}
}
}
for(i=t;i<maxim;i++)
{
if(d[i]!=0 && d[i]<minim)
{
minim=d[i];
}
}
g<<minim;
}
return 0;
}