Cod sursa(job #1279993)
| Utilizator | Data | 1 decembrie 2014 12:24:47 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, m, i, j, k;
int v[500001];
void write(){
for(int i = 1; i <= n; i ++)
fout << v[i] << " ";
return;
}
void sort(){
sort(v + 1, v + n + 1);
return;
}
void read(){
fin >> n;
for(int i = 1; i <= n; i ++)
fin >> v[i];
return;
}
void program(){
read();
sort();
write();
return;
}
int main(){
program();
return 0;
}
