https://www.pbinfo.ro/probleme/3902/sortsum

#include<stdio.h>


int sumCif(int n){
 int sumCif = 0;
    while(n != 0){
       sum += (double)a / 10;
        n /= 10;
    }
    return sumCif;
}


void swap(int *xp, int *yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}

// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
    int i, j;
    for (i = 0; i < n-1; i++)

    // Last i elements are already in place
    for (j = 0; j < n-i-1; j++)
        if (sumCif(arr[j]) > sumCif(arr[j+1]))
            swap(&arr[j], &arr[j+1]);
       else if (sumCif(arr[j]) == sumCif(arr[j+1]))
            swap(&arr[j+1], &arr[j]);
}
int main(){

}