Cod sursa(job #1025223)
Utilizator | Data | 9 noiembrie 2013 17:25:53 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in", ios::in);
ofstream g("algsort.out", ios::out);
long nmax=500000;
int main()
{
long n,a[nmax],i,j,aux;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<n;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++)
g<<a[i]<<" ";
return 0;}