Cod sursa(job #2193403)
Utilizator | Data | 9 aprilie 2018 23:26:07 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define NMAX 500002
using namespace std;
ifstream f("algsort.in");
ofstream o("algsort.out");
int n, v[NMAX];
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
f >> v[i];
sort(v+1,v+n+1);
for(int i =1 ; i <= n; ++i)
o << v[i] << ' ';
return 0;
}