2108_InsertSort

#include <stdio.h>
#include <stdlib.h>

int numAvg(int arr[], int num){
    int sum = 0;
    for (int i = 0; i < num; i++)
        sum += arr[i]; 
    return sum/num;
}

int maxCount(int arr[], int num) {
}

int insertSort(int arr[], int num){
    int temp;
    for (int i = 1; i < num; i++) {
        for (int j = 0; j < i; j++) {
            if (arr[i] < arr[j]) {  //inserSort
                temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
}

int main() {
    int num; scanf("%d",&num);  // number of length
    int arr[num];  
    
    for (int i = 0; i < num; i++)  //enter the data 
        scanf("%d",&arr[i]); 
    
    int sum = numAvg(arr,num);  //avg
    insertSort(arr,num);  //sort
    int mid = num/2;  // middle
    int cnt = maxCount(arr,num); //maxCount
    
    printf("%d %d %d",sum,arr[mid],arr[cnt]); 
    return 0;
}