Cod sursa(job #1337237)
Utilizator | Data | 8 februarie 2015 19:29:31 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
#define DMAX 500002
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n;
int a[DMAX];
int main()
{
int i;
fin>>n;
for (i=1; i<=n; ++i) fin>>a[i];
sort(a+1, a+n+1);
for (i=1; i<=n; ++i) fout<<a[i]<<' ';
fout<<'\n';
fout.close();
return 0;
}