Cod sursa(job #1365803)
Utilizator | Data | 28 februarie 2015 15:45:06 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int n, s, nr, i, j, a, v[500001];
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>nr;
v[i]=nr;
}
for(i=1; i<=n; i++)
for(j=i+1; j<=n; j++)
if(v[i]>v[j])
{
a=v[j];
v[j]=v[i];
v[i]=a;
}
for(i=1; i<=n; i++)
fout<<v[i]<<" ";
return 0;
}