Cod sursa(job #1918666)
| Utilizator | Data | 9 martie 2017 16:23:55 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n, i, j, v[500001];
int main()
{
f >> n;
for(i=1;i<=n;i++)
f >> v[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[j]<v[i]) swap(v[i],v[j]);
for(i=1;i<=n;i++)
g << v[i] << " ";
g << '\n';
return 0;
}
