Cod sursa(job #562493)
Utilizator | Cornigeanu Calin Sadmann | Data | 23 martie 2011 10:11:20 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<algorithm>
#include<list>
#include<vector>
using namespace std;
bool myfunction (int i,int j) { return (i>j); }
int n,x;
vector<int> V;
int main()
{
ifstream in("quicksort.in");
ofstream out("quicksort.out");
in>>n;
for(int i=1;i<=n;i++)
{
in>>x;
V.push_back(x);
}
for(int i=1;i<=n;i++)
{
nth_element(V.begin(),V.end(),V.end(),myfunction);
out<<V[V.size()-1]<<" ";
V.pop_back();
}
return 0;
}