-
Notifications
You must be signed in to change notification settings - Fork 0
/
ACM - Add All-Try.c
52 lines (47 loc) · 1.05 KB
/
ACM - Add All-Try.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<stdio.h>
long long int a[2000005];
int main()
{
long long int n, i, j, k, add, cost, m, l;
while(scanf("%lld",&n)==1)
{
if(n==0)
break;
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
}
cost=0; m=n;
for(k=1;k<n;k++)
{
sort(m,a);
for(i=0;i<=m;i++)
{
if(i==0)
{
a[i]=a[i]+a[i+1];
cost=cost+a[i];
m--;
}
else
{
a[i]=a[i+1];
}
}
}
printf("%lld\n",cost);
}
return 0;
}
int sort(long long int m, long long int x[])
{
int i, j, t;
for(i = 1; i <= m-1; i++)
for(j = 1; j <= m-i; j++)
if(x[j-1] >= x[j])
{
t = x[j-1];
x[j-1] = x[j];
x[j] = t;
}
}