Cod sursa(job #1117612)
| Utilizator | Data | 23 februarie 2014 18:04:01 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
long int n,i,j,aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
unsigned long long int v[n+2];
if(n<=1000)
{
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
{
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
}
for(i=1;i<=n;i++)
{
g<<v[i]<<" ";
}
}
if(n>1000)
{
for(i=n;i<=1;i--)
g<<v[i]<<" ";
}
return 0;
}
