Cod sursa(job #768210)
Utilizator | Data | 16 iulie 2012 12:54:18 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500010],a,m,i,j,p,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];p=n;
for(i=1;i<n-1;i++)
{ m=v[1];a=1;
for(j=2;j<=p;j++)
{
if(v[j]>m)
{
m=v[j];
a=j;
}
}
v[a]=v[p];
v[p]=m;
p--;
}
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}