Cod sursa(job #2411743)
Utilizator | Data | 21 aprilie 2019 11:06:02 | |
---|---|---|---|
Problema | Energii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int n,x,maxim,k,minim,i1,i,g1,g;
int d[10004];
int main()
{
in>>n>>g1;
for(int i=1; i<=g1; i++)
{
d[i]=100000;
}
for(int i=1; i<=n; i++)
{
in>>g>>x;
for(int j=g1; j>=0; j--)
{
if(d[j]!=100000 && g+j<=g1)
{
d[j+g]=min(d[j+g],d[j]+x);
}
if(g+j>g1)
{
d[g1]=min(d[g1],d[j]+x);
}
}
}
if(d[g1]==100000)
out<<"-1";
else
out<<d[g1];
return 0;
}