很简单的一道排序计算题
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
const int N = 1e5 + 10;
const int mod = 998244353;
void solve() {
int n;
cin>>n;
vector<int> a(n+1);
int sum = 0; //记录总和
for(int i = 1 ; i <= n ; i++){
cin>>a[i];
sum += a[i];
}
sort(a.begin()+1,a.end());
int sum1 = 0;
for(int i = 1 ; i <= n/2 ; i++){
sum1 += a[i];
}
cout<<"Outgoing #: "<<(n+1)/2<<endl;
cout<<"Introverted #: "<<n/2<<endl;
cout<<"Diff = "<<sum-2*sum1<<endl;
}
signed main() {
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int tt = 1;
// cin >> tt;
while (tt--) {
solve();
}
return 0;
}