Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <nmmintrin.h>
#include <chrono>
#include <list>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589
#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*)array, (T*)(array + N), val);
}



#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
class Bitvector {
	//4byteブロック 全部半径、0-index
	static const int mask[32];
public:

	unsigned int* st;
	unsigned int* blockrank;
	int sz;
	Bitvector(int n) {
		sz = n;
		st = (unsigned int*)calloc((n + 31) / 32, sizeof(int));
		blockrank = (unsigned int*)calloc((n + 31) / 32 + 1, sizeof(int));
		if (st == NULL || blockrank == NULL)
			abort();
	}
	inline void set(int a, bool f) {//後から追加はできない
		if (f)bitset(st[a / 32], (31 - a % 32));
	}
	inline bool get(int a) { return bitcheck(st[a / 32], (31 - a % 32)); }
	inline void calcblock() {
		int cou = 0;
		REP(i, sz + 1) {
			if (i && !(i % 32))blockrank[i / 32] = cou;
			if (i<sz)cou += bitcheck(st[i / 32], (31 - i % 32));
		}
	}
	int rank(int a, bool t) {
		int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
		return t ? ret : a - ret;
	}
	int select(int a, bool t) {
		int l = 0, r = sz + 1;

		while (r - l > 1) {
			int mid = (l + r) / 2;
			if (rank(mid, t) >= a) r = mid;
			else l = mid;
		}
		if (rank(r, t) < a) return -1;
		return r;
	}
	void clear() {
		free(st);
		free(blockrank);
	}
};

//プリミティブ型だけだよ！！！！(低レベルでうぇぶるので)
template<typename T>
class WaveletMatrix {
public:
	vector<T> data;
	vector<Bitvector> bitv;
	vector<int> border;
	int bitsize;

	WaveletMatrix(vector<T>& dat) : bitsize(sizeof(T) * 8), data(dat) {
		bitv.reserve(bitsize);
		REP(i, bitsize + 1)
			bitv.push_back(Bitvector(data.size()));
		border.resize(bitsize + 1);
		REP(j, data.size())
			bitv[0].set(j, bitcheck(data[j], bitsize - 1));
		bitv[0].calcblock();
		vector<T> buf[2];
		buf[0] = data;
		buf[1].resize(data.size());

		REP(i, bitsize - 1) {
			border[i + 1] = bitv[i].rank(data.size(), 0);
			int cou[2] = { 0, border[i + 1] };
			REP(j, data.size()) {
				bitv[i + 1].set(cou[bitv[i].get(j)], bitcheck(buf[i % 2][j], bitsize - i - 2));
				buf[1 - i % 2][cou[bitv[i].get(j)]] = buf[i % 2][j] << (i + 1) >> (i + 1);
				cou[bitv[i].get(j)]++;
			}
			bitv[i + 1].calcblock();
		}
		border[bitsize] = bitv[bitsize - 1].rank(data.size(), 0);
	}

	pii search(int s, int e, unsigned int t, int b = 0) {
		if (b == bitsize) return{ s,e };
		bool cur = bitcheck(t, bitsize - 1);
		return search(cur*border[b + 1] + bitv[b].rank(s, cur), cur*border[b + 1] + bitv[b].rank(e, cur), t << 1, b + 1);
	}
	int backward(int a, unsigned int t, int b = 0) {
		if (b == bitsize - 1) return a;
		backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
	}

	int rank(int s, int e, T t) {
		pii r = search(s, e, t);
		return r.second - r.first;
	}

	int select(int a, T t) {
		pii r = search(0, data.size(), t);
		return  backward(r.first + a - 1, t);
	}

	T less_kthelement(int s, int e, int k, int b = 0) {//小さいほうから 0番目~
		int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = eo - so;
		if (b == bitsize - 1) return cou <= k;
		return (cou <= k ?
			less_kthelement(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), k - cou, b + 1) :
			less_kthelement(so, so + cou, k, b + 1)) | ((cou <= k) << (bitsize - b - 1));
	}

	T more_kthelement(int s, int e, int k, int b = 0) {//上からk個のsum 0番目~
		int eo = bitv[b].rank(e, 1), so = bitv[b].rank(s, 1), cou = eo - so;
		if (b == bitsize - 1) return cou > k;
		return (cou > k ?
			more_kthelement(border[b + 1]+so, border[b + 1]+ so + cou, k, b + 1) :
			more_kthelement(s-so, (s - so) + (e - s - cou), k - cou, b + 1)) | ((cou > k) << (bitsize - b - 1));
	}

	T more_kthsum(int s, int e, int k, int b = 0) {//大きいほうから 0番目~
		int eo = bitv[b].rank(e, 1), so = bitv[b].rank(s, 1), cou = eo - so;
		if (b == bitsize - 1) return min(1+k,cou);

		return (cou > k ? more_kthsum(border[b + 1] + so, border[b + 1] + so + cou, k, b + 1) :
			(cou ? more_kthsum(border[b + 1] + so, border[b + 1] + so + cou, cou - 1, b + 1) : 0)+
			more_kthsum(s - so, (s - so) + (e - s - cou), k - cou, b + 1))
			+ min(k+1,cou) * pow(2, bitsize - b - 1);
	}
	T less_kthsum(int s, int e, int k, int b = 0) {//小さいほうから 0番目~
		int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = eo - so;
		if (b == bitsize - 1) return max(0, (k+1) - cou);

		return (cou <= k ? 
			
			(less_kthsum(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), k - cou, b + 1) 
			+ less_kthsum(so, so + cou, cou-1, b + 1)
				)
			:

			less_kthsum(so, so + cou, k, b + 1))
			+ max(0, (k + 1) - cou) * pow(2, bitsize - b - 1);
	}

	int less(int s, int e, T t, int b = 0) {
		int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = (eo - so);
		if (b == bitsize) return e - s;
		return bitcheck(t, bitsize - b - 1) ?
			less(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), t, b + 1) + cou :
			less(so, so + cou, t, b + 1);
	}

	~WaveletMatrix() {
		REP(i, bitsize) bitv[i].clear();
	}
};

signed main() {
	int n;
	scanf("%d", &n);

	vector<ll> num(n*3);
	REP(i, n*3) {
		scnaf("%d", &num[i]);
	}

	WaveletMatrix<ll> wv(num);
	
	ll Max = LLONG_MIN;

	rep(i, n, n*2) {
		ll b = wv.more_kthsum(0, i, n - 1), c = wv.less_kthsum(i, n * 3, n - 1);
		Max = max(Max, b - c);
	}
	printf("%d\n", Max);
	return 0;
}

Compiler output:
In file included from /usr/lib/gcc/x86_64-linux-gnu/14/include/smmintrin.h:812,
                 from /usr/lib/gcc/x86_64-linux-gnu/14/include/nmmintrin.h:31,
                 from a.cc:18:
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h: In member function 'int Bitvector::rank(int, bool)':
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h:35:1: error: inlining failed in call to 'always_inline' 'int _mm_popcnt_u32(unsigned int)': target specific option mismatch
   35 | _mm_popcnt_u32 (unsigned int __X)
      | ^~~~~~~~~~~~~~
a.cc:88:90: note: called from here
   88 |                 int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
      |                                                                            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~