Cod sursa(job #3038461)
Utilizator | Data | 27 martie 2023 13:34:00 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int i, j, n, m, st, dr, mid, k, maxim, maxp;
int v[500002], w[500002];
int main() {
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=n;i>=2;i--){
maxim=0;
for(j=1;j<=i;j++){
if(v[j]>maxim){
maxim=v[j];
maxp=j;
}
}
if(maxp!=i){
swap(v[maxp], v[i]);
}
}
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
}