Cod sursa(job #881565)
| Utilizator | Data | 18 februarie 2013 11:43:26 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
#include<stdlib.h>
using namespace std;
int n,v[500000];
void citeste()
{
ifstream in("algsort.in");
in>>n;
int i;
for(i=0;i<n;i++)
in>>v[i];
in.close();
}
int dovleac(const void*a,const void*b)
{
int x,y;
x=*(int *)a;
y=*(int *)b;
return x-y;
}
int main()
{
citeste();
qsort(v,n,sizeof(int),dovleac);
int i;
ofstream out("algsort.out");
for(i=0;i<n;i++)
out<<v[i]<<" ";
out.close();
return 0;
}
