Pagini recente » Cod sursa (job #2858227) | Cod sursa (job #266997) | Cod sursa (job #1510518) | Cod sursa (job #414038) | Cod sursa (job #2891067)
#include <bits/stdc++.h>
#define ll long long
#define INF 0x3F3F3F3F
using namespace std;
const string fisier = "energii";
ifstream fin (fisier + ".in");
ofstream fout (fisier + ".out");
const int N_MAX = 1e3 + 5 , M_MAX = 5e3 + 5;
int dp[N_MAX][M_MAX];
int n , w , c[N_MAX] , e[N_MAX];
int solve (){
for (int i=0; i<=n; i++){
for (int j=0; j<=w; j++){
dp[i][j] = 1e8;
}
}
for (int i=1; i<=n; i++){
for (int j=0; j<=w; j++){
if (j <= c[i]){
dp[i][j] = min(dp[i - 1][j] , e[i]);
}
else{
dp[i][j] = min(dp[i - 1][j] , dp[i - 1][j - c[i]] + e[i]);
}
}
}
return ((dp[n][w] == 1e8) ? -1 : dp[n][w]);
}
int main(){
ios_base::sync_with_stdio(false);
fin >> n >> w;
for (int i=1; i<=n; i++){
fin >> c[i] >> e[i];
}
fout << solve();
}