Cod sursa(job #887588)
Utilizator | Data | 23 februarie 2013 21:40:30 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
long long n,i,j,x,v[500001];
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
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[i]>v[j])
{
x=v[i];
v[i]=v[j];
v[j]=x;
}
for(i=1;i<=n;i++)
g<<v[i]<<' ';
return 0;
}