解题思路详见代码里的注释

话不少说，直接上代码 击败了0%的用户

#include<bits/stdc++.h> using namespace std; int n,a,b=1,s1,s2; int m[1010]; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>m[i]; } for(int j=1;j<n;j++){ for(int i=1;i<=n-j;i++){ if(m[i]<m[i+1]){ a=m[i]; m[i]=m[i+1]; m[i+1]=a; } } } s1+=m[1]; for(int i=2;i<=n;i++){ if(b1||b2){ s2+=m[i]; } else{ s1+=m[i]; } b+=1; if(b==5){ b=1; } } cout<<abs(s1-s2); }

#include<bits/stdc++.h> using namespace std; int a[1005]; vector<int>d1,d2; bool cmp(int x,int y){ return x>y; } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } sort(a+1,a+1+n,cmp); d1.push_back(a[1]); int flag=1; for(int i=2;i<=n;i++){ if(flag==1){ d2.push_back(a[i]); i++; d2.push_back(a[i]); flag=0; }else{ d1.push_back(a[i]); i++; d1.push_back(a[i]); flag=1; } } int s1=0,s2=0; for(int i=0;i<d1.size();i++){ s1+=d1[i]; } for(int i=0;i<d2.size();i++){ s2+=d2[i]; } cout<<abs(s1-s2); }

#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; int a[n+1]; for(int i=0;i<n;i++){ cin >> a[i]; } sort(a,a+n,greater<int>()); a[n]=0; int sum1 = a[0]; for (int i=3;i<n;i=i+4) { sum1 = sum1+a[i]+a[i+1]; } int sum2 = 0; for (int i=1;i<n;i=i+4) { sum2 = sum2+a[i]+a[i+1]; } int res; res = sum1 - sum2; if (res>=0) cout << res<<" "; else cout << -res<<" "; }