Cod sursa(job #377648)
| Utilizator | Data | 25 decembrie 2009 18:28:37 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const char InFile[]="algsort.in";
const char OutFile[]="algsort.out";
const long int MaxN=500010;
long int N, v[MaxN];
int main(){
ifstream fin(InFile);
fin>>N;
for(register int i=0;i<N;++i){
fin>>v[i];
}
fin.close();
sort(v,v+N);
ofstream fout(OutFile);
for(register int i=0;i<N;++i){
fout<<v[i]<<" ";
}
fout.close();
return 0;
}
