Cod sursa(job #1151002)
Utilizator | Data | 23 martie 2014 19:48:26 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <cstdio>
#include <fstream>
using namespace std;
int n, v[500005];
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for (int i=1; i<=n; i++)
fin>>v[i];
for (int i=1; i<n; i++)
for (int j=i+1; j<=n; j++)
if (v[i] > v[j])
swap(v[i], v[j]);
for (int i=1; i<=n; i++)
fout<<v[i]<<" ";
return 0;
}