Cod sursa(job #1234838)
| Utilizator | Data | 28 septembrie 2014 09:50:54 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define nmax 500001
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, i;
int A[nmax];
void read()
{
fin >> n;
for (i=1; i<=n; i++)
fin >> A[i];
}
void write()
{
for (i=1; i<=n; i++)
fout << A[i] << " ";
fout << "\n";
}
int main()
{
read();
sort(A + 1, A + n + 1);
write();
fin.close();
fout.close();
return 0;
}