水题,还以为是并查集想练练的。。。
#include<iostream>
#include<algorithm>
using namespace std;
//分两种情况,偶数好办,奇数也办,总之就是外向的人数大于等于内向的人数
int main() {
int n,ji,ou;
cin>>n;
ji = n / 2; ou = n - ji;
int people[n];
for(int i = 0; i < n; i++)
cin>>people[i];
sort(people, people + n);
int temp(0);
for(int i = 0; i < ji; i++)
temp -= people[i];
for(int i = ji; i < n; i++)
temp += people[i];
cout<<"Outgoing #: "<<ou<<endl;
cout<<"Introverted #: "<<ji<<endl;
cout<<"Diff = "<<temp<<endl;
}