Cod sursa(job #2547829)
| Utilizator | Data | 15 februarie 2020 18:47:41 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
int comp(const void *p1, const void *p2)
{
int *a=(int*)p1;
int *b=(int*)p2;
return *a-*b;
}
int main()
{
int n;
fin>>n;
int v[500000];
for (int i=0; i<n; i++)
fin>>v[i];
qsort(v,n,sizeof(int),comp);
for (int i=0; i<n; i++)
fout<<v[i]<<" ";
return 0;
}
