Cod sursa(job #1004728)
| Utilizator | Data | 3 octombrie 2013 16:40:27 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, v[500001], i, aux, poz, j;
int main(){
fin>>n;
j=n;
for(i=1; i<=n; i++)
fin>>v[i];
do{
poz=0;
for(i=1; i<=j; i++)
if(v[poz]<v[i])
poz=i;
//interschimb pe v[poz] cu v[j]
aux=v[j];
v[j]=v[poz];
v[poz]=aux;
j--;
}while(j>1);
for(i=1; i<=n; i++)
fout<<v[i]<<" ";
return 0;
}
