Pagini recente » Cod sursa (job #2097653) | Cod sursa (job #2203338) | Cod sursa (job #1770730) | Cod sursa (job #2171684) | Cod sursa (job #2520163)
#include<bits/stdc++.h>
using namespace std;
int w[1010],c[1010],n,g,tot,ans[10001*1001+5];
int32_t main(){
ifstream cin("energii.in");
ofstream cout("energii.out");
cin >> n >> g;
for(int i = 1; i <= n; i++){
cin >> w[i] >> c[i];
tot += c[i];
}
for(int i = 1; i <= n; i++){
for(int j = tot; j >= c[i]; j--){
ans[j] = max(ans[j] , ans[j-c[i]] + w[i]);
}
}
for(int i = 1; i <= tot; i++){
if(ans[i] >= g){
cout<<i;
return 0;
}
}
}