40分求助大佬

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n;
int a[N];
int b[N];
int ans;
int mj(int l,int r)
{
	while (l<r)
	{
		l++;
		if (l==r)
		{
		break;
		}
		r--;
	}
	return b[l];
}
int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	ans=(n+1)/2;
	for (int i=1;i<=n;i+=2)
	{
		for (int j=1;j<=i;j++)
		{
			b[j]=0;
			b[j]=a[j];
		}
		sort(b+1,b+i+1);
		printf("%d\n",mj(1,i));
	}
	return 0;
}