Pagini recente » Borderou de evaluare (job #2451991) | Cod sursa (job #633978) | Cod sursa (job #2434404) | Cod sursa (job #2447564) | Cod sursa (job #1004760)
#include<fstream>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, v[500001], i, x, m, j;
int main(){
fin>>n;
j=n;
for(i=1; i<=n; i++){
fin>>x;
if(x>m)
m=x;
v[x]++;
}
for(i=0; i<=m; i++){
if(v[i]!=0)
for(j=1; j<=v[i]; j++)
fout<<i<<" ";
}
//for(i=1; i<=n; i++)
// fout<<v[i]<<" ";
return 0;
}