Cod sursa(job #821027)
Utilizator | Data | 21 noiembrie 2012 15:59:05 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int a[500001];
int main()
{int i,n,m,max=0;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++){f>>m;
a[m]=a[m]+1;
if(max<m)max=m;}
for(i=1;i<=max;i++){if(a[i]>1){g<<i<<' ';
a[i]=a[i]-1;}
if(a[i]!=0) g<<i<<' ';}
}