POJ 3253 Fence Repair

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
while (cin >> n)
{
int a[20002];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 1)
{
cout << a[0] << endl; continue;
}
sort(a, a + n);
long long sum = 0;
while (n > 1)
{
int j = 0, k = 1;
if (a[0] > a[1]) swap(j,k);
for (int i = 2; i < n; i++)
{
if (a[i] < a[j])
{
k = j, j = i;
}
else if (a[i] < a[k])
k = i;
}
sum = sum + a[j] + a[k];
if (j == n - 1) swap(j, k);
a[j] = a[j] + a[k];
a[k] = a[n - 1]; n--;
}
cout << sum << endl;
}
return 0;
}