Meximization

题目链接:https://codeforces.com/problemset/problem/1497/A

My Answer Code:

/*
	Author:Albert Tesla Wizard
	Time:2021/3/19 00:31
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        bool ans=false;
        vector<int>a(n);
        for(int i=0;i<n;i++)cin>>a[i];
        for(int i=0;i<n;i++)if(a[i]==0){ans=true;break;}
        if(!ans)
        {
            for(int i=0;i<n;i++)cout<<a[i]<<" ";
            cout<<'\n';
        }
        else
        {
            vector<int>c(n);
            int b[101]={0};
            for(int i=0;i<n;i++)b[a[i]]++;
            int cnt=0;
            for(int i=0;i<=100;i++)if(b[i])c[cnt++]=i;
            sort(c.begin(),c.begin()+cnt);
            for(int i=1;i<=100;i++)
            {
                if(b[i]>1)
                {
                    int cnt1=b[i]-1;
                    while(cnt1--)c[cnt++]=i;
                }
            }
            for(int i=0;i<n;i++)cout<<c[i]<<" ";
            cout<<'\n';
        }
    }
    return 0;
}