Submission #66193076

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

typedef long long i64;

void solve() {
    int n;
    cin >> n;
    vector<int> a(2 * n + 1);
    for(int i = 1; i <= 2 * n; i++) {
        cin >> a[i];
    }

    priority_queue<int> heap;
    i64 ans = 0;
    for(int i = 1; i <= 2 * n; i++) {
        heap.push(a[i]);
        if(i & 1) {
            ans += heap.top();
            heap.pop();
        }
    }

    cout << ans << '\n';
}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int t;
    cin >> t;
    while(t--) {
        solve();
    }
    
    return 0;
}

Submission Info

Judge Result