Cod sursa(job #2310154)
Utilizator | Data | 30 decembrie 2018 17:35:56 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[5000001],n,i,j,N,c;
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])
{c=v[i];
v[i]=v[j];
v[j]=c;}
for(i=1; i<=N; i++)
g<<v[i];
return 0;
}