Cod sursa(job #893864)
Utilizator | Data | 26 februarie 2013 18:22:37 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int i, j, n, v[500002], p, t, m, aux, maxim;
int main(){
ifstream f("grozavesti.in");
ofstream g("grozavesti.out");
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(t=n; t>=1; t--){
maxim=-2000000000;
for(i=1; i<=t; i++){
if(v[i]>maxim){
maxim=v[i];
p=i;
}
}
v[p]=v[t];
v[t]=maxim;
}
for(i=1; i<=n; i++)
g<<v[i]<<" ";
return 0;
}