Cod sursa(job #1131651)
Utilizator | Data | 28 februarie 2014 23:00:56 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include<cstdlib>
using namespace std;
int n,i,x[500003];
int cmp(const void* a, const void* b)
{
int x,y;
x=*(int*)a;
y=*(int*)b;
}
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for(i=0;i<n;i++)
fin>>x[i];
qsort(x,n,sizeof(int),cmp);
for(i=0;i<n;i++)
fout<<x[i]<<' ';
fout.close();
return 0;
}