求助

#include<bits/stdc++.h>
#include<bits/extc++.h>
#define int long long

using namespace std;
using namespace __gnu_pbds;

tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> Tr;

int n;
map<int,int> Map;

signed main()
{
    scanf("%lld",&n);
    for(int i=1,x;i<=n;i++)
        scanf("%lld",&x),Tr.insert(x),Map[x]++;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=Map[*Tr.find_by_order(i-1)];j++)
            printf("%lld ",*Tr.find_by_order(i-1));
    return 0;
}