对顶堆求助

#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;

const int MAX_N = 5e5+5;

int n, a[MAX_N];
LL kk, bb;
priority_queue<int> qmax;
priority_queue<int, vector<int>, greater<int> > qmin;

int main () {
	freopen("data.txt","r",stdin);
	scanf("%d",&n);
	for(int i = 1; i <= n; i ++) {
		scanf("%d",&a[i]);
		while(!qmin.empty()) {
			-- kk;
			bb += qmin.top();
			qmin.pop();
		}
		++ kk;
		bb -= a[i];
		qmin.push(a[i]);
		qmin.push(a[i]);
		while(!qmin.empty() && !qmax.empty() && qmin.top() < qmax.top()) {
			qmin.push(qmax.top());
			qmax.pop();
		}
		while(!qmin.empty() && (int)qmin.size() > kk) {
			qmax.push(qmin.top());
			qmin.pop();
		}
		while(!qmax.empty() && (int)qmin.size() < kk) {
			qmin.push(qmax.top());
			qmax.pop();
		}
//		if(i > 1e4) printf("i = %d  qmax_size = %u  qmin_size = %u\n",i,qmax.size(),qmin.size());
	}
	while(!qmin.empty()) {
		-- kk;
		bb += qmin.top();
		qmin.pop();
	}
	printf("%lld\n",bb);
	return 0;
}

#include <random>
#include <ctime>
#include <cstdio>
using namespace std;
mt19937 RAND(time(NULL));

const int N = 1e5, V = 1e9;

int main () {
	freopen("data.txt","w",stdout);
	printf("%d\n",N);
	for(int i = 1; i <= N; i ++) {
		if(RAND()&1) {
			printf("%d ",-(int)RAND()%V);
		}
		else printf("%d ",(int)RAND()%V);
	}
	return 0;
}