Cod sursa(job #1235784)
Utilizator | Data | 30 septembrie 2014 17:43:41 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define nmax 500005
using namespace std;
int v[nmax];
int i, k, n, aux;
bool ord;
int main ()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f >> n;
for(i=1; i<=n; i++)
{
f >> v[i];
}
sort(v+1, v+n+1);
for(i=1; i<=n; i++)
{
g << v[i] << " ";
}
f.close();
g.close();
}