Cod sursa(job #311233)
| Utilizator | Data | 3 mai 2009 00:21:34 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> a;
int n,i,x;
inline void Cout(int x)
{
printf("%d ",x);
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
a.push_back(x);
}
nth_element(a.begin(),max_element(a.begin(),a.end()),a.end());
for_each(a.begin(),a.end(),Cout);
printf("\n");
return 0;
}