Cod sursa(job #1594970)
Utilizator | Data | 9 februarie 2016 20:52:28 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <queue>
#include <iostream>
#define Nmax 500005
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[Nmax];
int n;
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)
g << v[i] << ' ';
}