#include<bits/stdc++.h> using namespace std; int main(){ int n,i,j,s[105],m[105],k,x; cin>>n; for(i=1;i<=n;i++){ cin>>s[i]; } sort(s****+1+n); for(i=1;i<=n;i++){ if(i%21){ cout<<s[i]<<" "; } } for(i=n;i>=1;i--){ if(i%20){ cout<<s[i]<<" "; } } return 0; }

#include <stdio.h> #include <algorithm> int a[61]; int main(){ int n; scanf("%d",&n); for (int i=0;i<n;i++) scanf("%d",&a[i]); std::sort(a,a+n); for (int i=0;i<n;i+=2) printf("%d ",a[i]); for (int i=n-2;i>=1;i-=2) printf("%d ",a[i]); return 0; }

#include <stdio.h> #include <algorithm> int a[61]; int main(){ int n; scanf("%d",&n); for (int i=0;i<n;i++) scanf("%d",&a[i]); std::sort(a,a+n); for (int i=0;i<n;i+=2) printf("%d ",a[i]); for (int i=n-2;i>=1;i-=2) printf("%d ",a[i]); return 0; }