Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int g,h,t,wq[25],pile1,pile2,res;
- scanf("%d",&t);
- for(g=0;g<t;g++) scanf("%d",&wq[g]);
- res=1e9;
- for(g=0;g<(1<<t);g++){
- pile1=pile2=0;
- for(h=0;h<t;h++){
- if(g&(1<<h)) pile1+=wq[h];
- else pile2+=wq[h];
- }
- res=min(res,abs(pile1-pile2));
- }
- printf("%d\n",res);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement