Pagini recente » Cod sursa (job #1808636) | Borderou de evaluare (job #1800782) | Cod sursa (job #3309257) | Cod sursa (job #2791460) | Cod sursa (job #1459815)
#include<iostream>
#include<fstream>
using namespace std;
long int n,i,a[500000],x,maxnr,minnr;
int main()
{
maxnr=minnr=0;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
{f>>x;
a[x]++;
if(x>maxnr)
maxnr=x;
if(x<minnr)
minnr=x;
}
for(i=minnr;i<=maxnr;i++)
if(a[i]!=0)
do{
g<<i<<" ";
a[i]--;
}while(a[i]!=0);
return 0;
}