Pagini recente » Cod sursa (job #2103332) | Cod sursa (job #1684152) | Cod sursa (job #2308509) | Cod sursa (job #2500235) | Cod sursa (job #1418064)
#include<fstream>
using namespace std;
int n, w, i, j, minim, x;
int f[20002], c[20002];
pair<int, int> v[1001];
ifstream fin("energii.in");
ofstream fout("energii.out");
int main(){
fin>> n >> w;
for(i = 1; i <= n; i++){
fin>> v[i].first >> v[i].second;
}
for(i = 1; i <= 20000; i++){
c[i] = 1000000000;
}
minim = 1000000000;
f[0] = 1;
c[0] = 0;
for(i = 1; i <= n; i++){
for(j = w; j >= 0; j--){
if(f[j] == 1){
x = j + v[i].first;
if(x > w){
c[w] = min(c[w], c[j] + v[i].second);
}
else{
c[x] = min(c[x], c[j] + v[i].second);
f[x] = 1;
}
}
}
}
fout<< c[w] <<"\n";
return 0;
}