Cod sursa(job #2421212)
Utilizator | Data | 14 mai 2019 15:25:41 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
long long int a[500000], N;
int i, x;
f>>N;
for(i=1;i<=N;i++)
f>>a[i];
for(i=1;i<N;i++)
if(a[i]>a[i+1])
swap(a[i], a[i+1]);
for(i=1;i<=N;i++)
g<<a[i]<<" ";
return 0;
}