题目：
You are given an array a1,a2,…,an. Array is good if for each pair of indexes i<j the condition j−aj≠i−ai holds. Can you shuffle this array so that it becomes good? To shuffle an array means to reorder its elements arbitrarily (leaving the initial order is also an option).
For example, if a=[1,1,3,5], then shuffled arrays [1,3,5,1], [3,5,1,1] and [5,3,1,1] are good, but shuffled arrays [3,1,5,1], [1,1,3,5] and [1,1,5,3] aren’t.
It’s guaranteed that it’s always possible to shuffle an array to meet this condition.
Input
The first line contains one integer t (1≤t≤100) — the number of test cases.
The first line of each test case contains one integer n (1≤n≤100) — the length of array a.
The second line of each test case contains n integers a1,a2,…,an (1≤ai≤100).
Output
For each test case print the shuffled version of the array a which is good.
样例：
输入：
3
1
7
4
1 1 3 5
6
3 2 1 5 6 4
输出：
7
1 5 1 3
2 4 6 1 3 5
题意： 给定你一个数组，让你对其中的元素进行顺序调整，使其满足
j - a[j] != i - a[i]。输出调整后的数组。
题解： 对数组进行排序，从大到小输出即可
AC代码：
#include<bits/stdc++.h>
using namespace std;
bool cmp(int a, int b){
return a > b;
}
int main()
{
int t; cin >> t;
while(t--){
int n; cin >> n;
int a[105];
for(int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n, cmp);
for(int i = 0; i < n; i++)
cout << a[i] << " ";
cout << endl;
}
return 0;
}
