Pagini recente » Cod sursa (job #423594) | Cod sursa (job #2593063) | Cod sursa (job #59193) | Cod sursa (job #2370078) | Cod sursa (job #3168207)
#include <bits/stdc++.h>
#define DIM 1001
#define MOD 30013
#define INF 1e18
#define MAX_VAL 15001
#define int long long
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int dp[MAX_VAL + 10];
pair <int, int> v[DIM];
int n, i, j, needed, answer = INF;
int32_t main(){
fin >> n >> needed;
for(i=1;i<=n;i++)
fin >> v[i].first >> v[i].second;
for(i=1;i<=MAX_VAL;i++)
dp[i] = INF;
for(i=1;i<=n;i++){
for(j=needed - 1; j ; j--){
dp[min(j + v[i].first, needed)] = min(dp[min(j + v[i].first, needed)], dp[j] + v[i].second);
}
}
if(dp[needed] != INF)
fout << dp[needed] << "\n";
else fout << "-1\n";
}