题目:
思路分析:
没什么好说的!
就是简单的排序 如果是偶数直接对半
反之放到活跃的一边!
代码实现:
const int N = 100005;
int n, ans[N];
int main(){
cin >> n;
for(int i = 0; i < n; i ++)
cin >> ans[i];
int in, ou;
in = ou = 0;
sort(ans, ans + n);
for(int i = 0; i < n; i ++){
if(i<n/2)
in += ans[i];
else
ou += ans[i];
}
cout << "Outgoing #: " << n-n/2 << endl;
cout << "Introverted #: " << n/2 << endl;
cout << "Diff = " << ou-in << endl;
return 0;
}