Cod sursa(job #2088786)
| Utilizator | Data | 15 decembrie 2017 21:03:02 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#include <algorithm>
FILE *f1 = fopen("algsort.in","r");
FILE *f2 = fopen("algsort.out","w");
const int N = 500005;
int n,i;
int v[N];
void citeste()
{
fscanf(f1,"%d",&n);
for(i=0;i<n;i++)
fscanf(f1,"%d",&v[i]);
}
void scrie()
{
for(i=0;i<n;i++)
fprintf(f2,"%d ",v[i]);
}
void sorteza()
{
std::sort(v, v+n);
}
int main()
{
citeste();
sorteza();
scrie();
return 0;
}
