Pagini recente » Cod sursa (job #2599629) | Cod sursa (job #1338237) | Cod sursa (job #1795374) | Cod sursa (job #262901) | Cod sursa (job #1367373)
#include <iostream>
#include <fstream>
using namespace std;
int t[11000][2];
int d[150001];
ifstream f("energii.in");
ofstream h("energii.out");
int main()
{
int n,g;
f>>n;
f>>g;
// cout<<n<<" ";
for(int i=1;i<=n;i++)
{
int j,k;
f>>j;
f>>k;
t[i][0]=j;
t[i][1]=k;
}
for(int i=1;i<=15000;i++)
d[i]=99999999;
d[0]=0;
int maxim=15000;
for(int i=1;i<=n;i++)
{
for(int j=15000;j>=0;j--)
{
d[j+t[i][0]]=min(d[j]+t[i][1],d[j+t[i][0]]);
}
}
int ok=1;
int mn=99999999;
for(int i=g;i<=15000;i++)
{
mn=min(mn,d[i]);
}
if(mn!=99999999)
h<<mn;
else
h<<"-1";
cout << "Hello world!" << endl;
return 0;
}