|排序奇偶分类下标|人以群分（25）

最新推荐文章于 2023-12-21 07:00:00 发布

PDYJ

最新推荐文章于 2023-12-21 07:00:00 发布

阅读量101

点赞数

分类专栏：天梯

本文链接：https://blog.csdn.net/weixin_44769957/article/details/108714029

版权

天梯专栏收录该内容

80 篇文章 0 订阅

订阅专栏

//1 8 10 23 46------46 99 555 666 2333//10//5
//0 1 2  3  4       5   6  7  8    9
//2 6 13 29 69 79 ---------85 110 119 135 218 3721 5188//13//6
//0 1 2  3  4  5           6  7   8    9   10  11   12
//79---85 110--195
//79 85--110
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    int n;
    cin>>n;
    int arr[n],sum=0;
    for(int i=0;i<n;i++){
        scanf("%d",&arr[i]);
        sum=sum+arr[i];
    }
    sort(arr,arr+n);
    //10---5//01234
    //13---6//012345
    
    int out=n/2;
    
    int sum1=0;
    for(int i=0;i<out;i++){//01234//012345//out_num
        sum1+=arr[i];//in_sum
    }
    
    int sum2=sum-sum1;//out_sum
    
    if(n%2==0){
        cout<<"Outgoing #: "<<out<<endl;
        cout<<"Introverted #: "<<n-out<<endl;
        cout<<"Diff = "<<sum2-sum1;
    }else{
        cout<<"Outgoing #: "<<out+1<<endl;
        cout<<"Introverted #: "<<n-out-1<<endl;
        cout<<"Diff = "<<sum2-sum1;
    }
    
    return 0;
    
}