Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n,g,i,Max,j,a[1002],b[1002],max1,s1[1000*10000+2],x;
- //ifstream cin("seful.in");
- //ofstream cout("seful.out");
- int main()
- {
- cin>>n>>g;
- for(i=1;i<=n;i++)
- {
- cin>>a[i]>>b[i];
- }
- for(i=1;i<=g;i++)
- {
- s1[i]=-1;
- }
- Max=0;
- for(i=1;i<=n;i++)
- {
- for(j=g-a[i];j>=0;j--)
- {
- if(s1[j]!=-1)
- {
- s1[j+a[i]]=max(s1[j+a[i]],s1[j]+b[i]);
- if(s1[j+a[i]]>max1)max1=s1[j+a[i]];
- }
- }
- }
- cout<<max1<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement