Cod sursa(job #1434983)
| Utilizator | Data | 11 mai 2015 19:46:29 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
#define dim 500001
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int A[dim],i,n,k;
int main()
{
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]<<" ";
return 0;
}
