Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- #define test int t; cin>>t; while(t--)
- ll a[100000],ans=10000000000,sum=0,n;
- void backtrack(int index,int value)
- {
- if(index==n)
- {
- ans=min(ans,abs((sum-value)-value));
- return;
- }
- else
- {
- backtrack(index+1,value);
- backtrack(index+1,value+a[index]);
- return;
- }
- return;
- }
- int main()
- {
- ios_base::sync_with_stdio(0);
- cin.tie(0);cout.tie(0);
- cin>>n;
- for(int i=0;i<n;i++)
- {
- cin>>a[i];
- sum+=a[i];
- }
- backtrack(0,0);
- cout<<ans<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement