Cod sursa(job #579189)
Utilizator | Alexandru Meterez alexutzu29 | Data | 11 aprilie 2011 21:55:49 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <cstdio>
#include <stdio.h>
using namespace std;
int main(void)
{
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
long long n,a[10000],aux,j,i;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=1;i<=n;i++) cout<<a[i];
return 0;
}