Ural 1306 Sequence Median

#include <iostream>
#include <queue>
#include <cstdio>
using namespace std;
int main()
{
priority_queue<int> q;
int n;
scanf("%d",&n);
int x;
int i;
for(i= 0; i<=n/2; ++i )
{
scanf("%d",&x);
q.push(x);
}
for(;i<n;i++)
{
scanf("%d",&x);
q.push(x);
q.pop();
}
if(n%2==1)
printf("%.1f\n",(double)q.top());
else
{
double a;
a=q.top();
q.pop();
a+=q.top();
a/=2;
printf("%.1f\n",a);
}
return 0;
}