Cod sursa(job #779671)
Utilizator | Data | 18 august 2012 14:47:46 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <time.h>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#define NMax 500010
using namespace std;
const char IN[]="algsort.in",OUT[]="algsort.out";
ifstream fin(IN);
ofstream fout(OUT);
int N;
int v[NMax];
int main()
{
int i;
fin>>N;
for (i=1;i<=N;++i) fin>>v[i];
fin.close();
srand(time(NULL));
sort(v+1,v+N+1);
for (i=1;i<=N;++i)fout<<v[i]<<" "; fout<<"\n";
fout.close();
return 0;
}