Cod sursa(job #3124536)
Utilizator | Data | 29 aprilie 2023 11:54:23 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n;
unordered_map<int,int>m;
int main(){
fin>>n; int max0=0;
for(int i=1;i<=n;i++){
int x; fin>>x;
max0=max(max0,x);
m[x]++;
}
for(int i=0;i<=max0;i++)
while(m[i]--)
fout<<i<<" ";
return 0;
}