1056. 组合数的和(15)

#include<iostream>
#include<cstdlib>
using namespace std;

int main()
{
  int N=0,*num,sum=0;

  scanf("%d",&N);
  num = (int *)malloc(sizeof(int)*N);
  int i=0;

  while(i<N)
  {
    scanf("%d",&num[i]);
    i++;
  }
  for(i=0; i<N; i++)
  {
    sum += (N-1)*num[i]*10;
    sum += (N-1)*num[i];
  }
  printf("%d",sum);
  return 0;
}