A Beautiful Array
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
standard input/output
Little Tinu is a handsome kid and likes only beautiful things. He has an array and wants its most beautiful permutation. The beauty of a 1-indexed array A is defined as:
where is integer division.
Input
The first line contains T(1 ≤ T ≤ 10), the number of test cases. Every test case contains 2 lines. First line has an integer N(1 ≤ N ≤ 103), the size of the array A. Second line contains the array A as space separated integers(0 ≤ Ai ≤ 106).
Output
Output for each test case, the maximum beauty of any permutation of the array A.
Input
2
3
3 2 1
4
1 40 70 40
Output
2
69
Sample test case 1:
There are 6 permutations possible:
Beauty = 2
Beauty = 1
Beauty = 1
Beauty = - 1
Beauty = - 1
Beauty = - 2
Maximum of all beauties is 2.
Sample test case 2:
The best permutation is [1, 40, 70, 40] where beauty is 69.
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int t, n;
long long a[1005];
scanf("%d", &t);
while(t--){
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a+1, a+n+1);
long long maxn = -10000000;
long long sum;
sum = 0;
for(int i = 1; i <= n/2; i++){
sum = sum+a[n-i+1]-a[i];
}
if(sum > maxn)
maxn = sum;
printf("%d\n", maxn);
}
return 0;
}