Cod sursa(job #276373)
| Utilizator | Data | 11 martie 2009 09:22:07 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include<fstream>
#include<stdlib.h>
using namespace std;
int n, sir [500000];
void read();
void write();
int cmp (void const *a, void const *b)
{
return *(int * )a- *(int *)b;
}
int main()
{
read();
qsort(sir, n , sizeof(sir[0]), cmp);
write();
return 0;
}
void write()
{
int i;
ofstream g ("algsort.out");
for (i=0;i<n;i++)
{
g<<sir[i]<<" ";
}
g.close();
}
void read()
{
int i;
ifstream f ("algsort.in");
f>>n;
for (i=0;i<n;i++)
{
f>>sir[i];
}
f.close();
}
