Pagini recente » Cod sursa (job #1873809) | Cod sursa (job #2931290) | Cod sursa (job #1246107) | Cod sursa (job #2207731) | Cod sursa (job #1981149)
#include<fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int n,m,i,j,minim,ok,e,c,dp[15001];
int main(){
in >> n >> m;
minim =1000000000;
for( i = 1; i <= 10000;i++){
dp[i] = 1000000000;
}
for( i = 1; i <= n; i ++ ){
in >> e >> c;
if( e < m ){
for( j = 10000; j >= e; j -- ){
dp[j] = min( dp[j] , dp[j-e] + c );
if( minim > dp[j] && j >=m ){
minim = dp[j];
ok = 1;
}
}
}
else{
if( minim > c ){
minim = c ;
ok = 1;
}
}
}
if( ok == 1){
out << minim;
}
else{
out<<-1;
}
return 0;
}