Cod sursa(job #1045071)
Utilizator | Data | 30 noiembrie 2013 20:49:25 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<iostream>
#include<algorithm>
#define Nmax 500000
using namespace std;
int main()
{
int v[Nmax],n,i,j;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
/*for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j])
swap(v[i],v[j]);*/
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}