献上我的代码

#include <bits/stdc++.h>
using namespace std;
int main(){
	// doge's sort
	long long doges[114514];
	long long data_doges[114514]={0};
	long long max_doge=-1919810,doge_n;
	cin >> doge_n;
	for(long long dog=0;dog<doge_n;dog++){
		cin >> doges[dog];
		if(doges[dog]>max_doge) max_doge=doges[dog];
	}
	for(long long doge=0;doge<=max_doge;doge++){
		for(long long dog=0;dog<doge_n;dog++){
			if(doges[dog]==0){cout << data_doges[dog] << " ";doges[dog]=-1;}
			else{doges[dog]--;data_doges[dog]++;}
		}
	}
	return 0;
}

qwq