Cod sursa(job #710574)
| Utilizator | Data | 10 martie 2012 01:13:16 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<stdlib.h>
using namespace std;
int n,V[500000];
ifstream f("algsort.in");
ofstream g("algsort.out");
int compare(const void *a,const void *b)
{
return(*(int*)a-*
(int*)b);
}
int main()
{
f>>n;
for(int i=0;i<n;i++)
f>>V[i];
qsort(V,n,sizeof(int),compare);
for(int i=0;i<n;i++)
g<<V[i]<<" ";
f.close();
g.close();
return 0;
}
