Pagini recente » Cod sursa (job #550246) | Cod sursa (job #2206105) | Cod sursa (job #220347) | Cod sursa (job #2303678) | Cod sursa (job #2761927)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,v[300000],ok=0,ok1=0,t=0,r=0,p;
cin>>n;
for(int i=0; i<n; ++i)
{
cin>>v[i];
if(v[i]==1)
ok=1;
}
if((n/2)%2==0)
ok1=1;
sort(v,v+n);
if(ok==1)
{
for(int i=0; i<n; ++i)
if(v[i]!=1)
{
p=i;
break;
}
for(int i=p;i<n;++i)
for(int j=p+1;j<n;++j)
if(v[i]<v[j])
{
int aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
r=0;
if(ok1==1)
{
for(int i=0; i<n/2; ++i)
{
cout<<v[i]<<" "<<v[n-1-r]<<" ";
r++;
}
}
else
{
for(int i=0; i<n/2; ++i)
{
cout<<v[n-1-r]<<" "<<v[i]<<" ";
r++;
}
}
return 0;
}