C :

#include<stdio.h>
int a[1000],b[1000];
int main()
{
	int T,N;
	scanf("%d",&T);
	while(T--)
	{
		int i,j,tem,s=0;
		scanf("%d",&N);
		for(i=0;i<N;i++)
			scanf("%d",&a[i]);
		for(i=0;i<N-1;i++)
			for(j=i+1;j<N;j++)
				if(a[i]>a[j])
				{
					tem=a[j];
					a[j]=a[i];
					a[i]=tem;
				}
				b[0]=a[0];
				for(i=1;i<N;i++)
					b[i]=a[i]+b[i-1];
				for(i=0;i<N;i++)
					s+=b[i];
				printf("%d\n",s);
	}
}

C++ :

#include<bits/stdc++.h>
using namespace std;
int a[1000000],ana=2,sum=0,n,d=1,min=100000,b[100000];

int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
	cin>>d;
	sum=0;ana=2;
	for(int j=1;j<=d;j++)
	{
		cin>>a[j];
		
	}
	sort(a+1,a+d+1);
	b[1]=a[1];
	for(int k=2;k<=d;k++)
	{
		b[ana]=b[ana-1]+a[k];
		//cout<<b[ana];
		
		ana++;
	}
	for(int l=1;l<=d;l++)
	sum+=b[l];
	cout<<sum<<endl;
}
	return 0;
}
 

Pascal :

program fdg;
var
  t,c,d,e,i,n,j,k,sum:longint;
  a,b:array[1..100000] of longint;
begin
 readln(t);
 for k:=1 to t do
 begin
   readln(n);
   for i:=1 to n do
   read(a[i]);
   for i:=1 to n-1 do
   for j:=i to n do
   if a[i]>a[j] then
   begin
     e:=a[i]; a[i]:=a[j]; a[j]:=e;
   end;
   for i:=1 to n do
   for j:=1 to i do
    sum:=sum+a[j];
    writeln(sum);
    sum:=0;
 end;
end.

Java :

import java.util.Scanner;
import java.util.Arrays;
public class Main
{
	public static void main(String[] args)
	{
		Scanner sc=new Scanner(System.in);
		int T=sc.nextInt();
		while(T-->0)
		{
			int N=sc.nextInt();
			int arr[]=new int[N];
			int sumTimes=0;
			for(int i=0;i<N;i++)
			{
				arr[i]=sc.nextInt();
			}
			Arrays.sort(arr);
			for(int i=0;i<N;i++)
			{
				for(int j=0;j<=i;j++)
				{
					sumTimes+=arr[j];
				}
			}
			System.out.println(sumTimes);
		}
	}
}