数组重排

数组重排

AcWing 3672
https://www.acwing.com/problem/content/3675/

其实只要逆序输出即可，不要全排列会TLE

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 101;

int T,n;
int a[N],b[N];

//i-j != a[i] - a[j]
//a[i] - a[j] != -N 逆序
int main()
{
    cin >> T;
    while (T--)
    {
        cin >> n;
        for (int i = 0; i < n; i ++ ) cin >> a[i];
        
        sort(a,a + n,greater<int>());
        
        for (int i = 0; i < n; i ++ ) cout << a[i] << ' '; cout << endl;
        
    }
    return 0;
}