Cod sursa(job #1841343)
Utilizator | Chira Cristian Cristi_Chira | Data | 5 ianuarie 2017 15:45:38 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <limits.h>
#include <cmath>
#include <math.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
long long a[500005];
int main()
{
int n, i, minim, j, k, aux;
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
for(i=1; i<=n; i++)
{
minim=a[i];
k=i;
for(j=i; j<=n; j++)
{
if(a[j]<minim)
{
minim=a[j];
k=j;
}
}
swap(a[i], a[k]);
}
for(i=1; i<=n; i++)
g<<a[i]<<" ";
return 0;
}