Cod sursa(job #573369)
Utilizator | Cornigeanu Calin Sadmann | Data | 6 aprilie 2011 10:50:17 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int n,x;
int v[500001];
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
in>>n;
for(int i=1;i<=n;i++)
{
in>>v[i];
}
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
{
if(v[i]>v[j])
{
int aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
for(int i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}