Cod sursa(job #2310147)
Utilizator | Data | 30 decembrie 2018 17:31:38 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[5000001],n,i,j,N;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>N;
for(i=1; i<=N; i++)
f>>v[i];
for(i=1; i<=N; i++)
for(j=1; j<=N; j++)
if(v[i]<v[j])
swap(v[i],v[j]);
for(i=1; i<=N; i++)
g<<v[i]<<" ";
return 0;
}