#include #include #include #include #include #include #include int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int main(){ int n; scanf("%d",&n); int *calories = malloc(sizeof(int) * n); for(int calories_i = 0; calories_i < n; calories_i++){ scanf("%d",&calories[calories_i]); } qsort(calories,n,sizeof(int),cmpfunc); long long int a=0; int i; for(i=n-1;i>=0;i--){ a=a+calories[i]*pow(2,n-1-i); } printf("%lld",a); // your code goes here return 0; }