Cod sursa(job #821020)
Utilizator | Data | 21 noiembrie 2012 15:56:32 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
int a[500000];
int main ()
{
ifstream f ("algsort.in");
ofstream g ("algsort.out");
int i, x, k=0, j;
long long n;
f >> n;
for (i=1; i<=n; i++)
{f >> x; if (x>k) k=x;
a[x]=a[x]+1;
}
for (i=1; i<=k; i++)
{
if (a[i]!=0)
for (j=1; j<=a[i]; j++) g << i << " ";
}
return 0;
}