[C++知识库]Codeforces Global Round 20 F1. Array Shuffling

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,a[N],t;
unordered_map<int,int> cnt;
map<int,vector<int> > mp;
vector<int> v;
void sol(){
    v.clear();cnt.clear();mp.clear();int mx=0;
    for(int i=1;i<=n;i++) v.push_back(a[i]),cnt[a[i]]++,mx=max(mx,cnt[a[i]]);
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
        mp[v[i]].push_back(v[(i+mx)%n]);
    for(int i=1;i<=n;i++){
        cout<<mp[a[i]].back()<<" ";
        mp[a[i]].pop_back();
    }cout<<endl;
}
int main(){
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        sol();
    }
}

创作打卡挑战赛

赢取流量/现金/CSDN周边激励大奖