Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- using namespace std;
- void IGORLOH(int m[], int n)
- {
- int i, j, t;
- for (i=0;i<n-1;i++)
- for(j=0;j<n-i-1;j++)
- if (m[j]<=m[j+1])
- {
- t=m[j];
- m[j]=m[j+1];
- m[j+1]=t;
- }
- }
- int main()
- {
- int c[20];
- int A_Sum=0;
- int B_Sum=0;
- int n;
- cin>>n;
- for (int i=0; i<n; i++)
- {
- cin>>c[i];
- }
- IGORLOH(c,n);
- for (int i=0; i<n; i++)
- {
- if (A_Sum<=B_Sum)
- {
- A_Sum+=c[i];
- }
- else
- {
- B_Sum+=c[i];
- }
- }
- cout<<abs(A_Sum-B_Sum);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement