Ural 1306. Sequence Median

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
priority_queue<unsigned int> que;
int main()
{
//freopen("in","r",stdin);
int n;
unsigned int u;
unsigned int ans;
scanf("%d",&n);
for(int i=0;i<=n/2;i++)
{
scanf("%u",&u);
que.push(u);
}
for(int i=n/2+1;i<n;i++)
{
scanf("%u",&u);
que.push(u);
que.pop();
}
if(n%2)
{
ans=que.top();
printf("%u\n",ans);
}
else
{
ans=que.top();
que.pop();
unsigned int tem=que.top();
printf("%u",(tem+ans)/2);
if((tem+ans)%2)
printf(".5");
printf("\n");
}
return 0;
}