Cod sursa(job #3125706)
| Utilizator | Data | 4 mai 2023 10:21:50 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int i, j, n, m, v[500002], maxim, p;
int main() {
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=n;i>=2;i--){
maxim=v[1];
p=1;
for(j=2;j<=i;j++){
if(v[j]>maxim){
maxim=v[j];
p=j;
}
}
swap(v[i], v[p]);
}
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
}
