URAL 1306. Sequence Median

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
const int maxn = 5002;
const int SIZE = 511111;
const double eps = 1e-10;
priority_queue<int> q;
int main() {
	ios::sync_with_stdio(false);
	int n, i, k;
	scanf("%d", &n);
	double ans;
	if (n < 4) {
		int a[6];
		for (i = 0; i < n; ++i)
			scanf("%d", a + i);
		sort(a, a + n);
		if (n & 1)
			ans = a[n / 2];
		else
			ans = (1.0 * a[n / 2] + a[n / 2 - 1]) * 0.5;
	} else {
		int t = n >> 1;
		for (i = 0; i <= t; ++i)
			scanf("%d", &k), q.push(k);
		for (i = t + 1; i < n; ++i) {
			scanf("%d", &k);
			if (k < q.top()) {
				q.pop();
				q.push(k);
			}
		}
		ans = q.top();
		q.pop();
		if (n % 2 == 0)
			ans += q.top(), ans *= 0.5;
	}
	printf("%.1f\n", ans);
	return 0;
}