Cod sursa(job #408472)
Utilizator | Data | 3 martie 2010 03:52:55 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
long long v[10000000],n,i,a[10000000],max=0;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
a[v[i]]++;
if(v[i]>max) max=v[i];
}
for(i=1;i<=max;i++)
while(a[i]!=0)
{
--a[i];
g<<i<<" ";
}
f.close();
g.close();
return 0;
}