Pagini recente » Cod sursa (job #295921) | Cod sursa (job #2938678) | Cod sursa (job #2465693) | Cod sursa (job #1884794) | Cod sursa (job #2047484)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int dp[3][5002];
vector<pair<int,int>>v;
int main(){
ifstream cin("energii.in");
ofstream cout("energii.out");
int n,g,i,line=1,a,b,k;
cin>>n>>g;
for(i=1;i<=n;i++){
cin>>a>>b;
v.push_back(make_pair(b,a));
}
for(i=1;i<=5001;i++){
if(i!=v[0].first)
dp[1][i]=0;
else
dp[1][i]=v[0].second;
}
for(i=2;i<=n;i++){
line=line%2+1;
for(k=1;k<=5001;k++){
if(k>=v[i-1].first && (dp[line%2+1][k-v[i-1].first]||k-v[i-1].first==0))
dp[line][k]=max(dp[line%2+1][k],dp[line%2+1][k-v[i-1].first]+v[i-1].second);
else
dp[line][k]=dp[line%2+1][k];
}
}
int sol=1000000000;
for(i=g;i<=5001;i++){
if(dp[line][i]>=g)
break;
}
if(i==5002){
cout<<-1;
return 0;
}
cout<<i;
return 0;
}