Submission

Score: 8

User: sukritp5

Problemset: แคง (Kang)

Language: cpp

Time: 0.361 second

Submitted On: 2026-04-14 16:26:51

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MXN=1e6+7;

std::vector<long long> capsize(std::vector<int> A, std::vector<int> B) {
  vector<ll> ans;
  priority_queue<ll> pq;
  int N=A.size(),K=B.size();
  ll sum=0;
  for(ll x:A){
    pq.push(x);
    sum+=x;
  }
  for(ll x:B){
    pq.push(x);
    sum+=x;
    sum-=pq.top();
    pq.pop();
    ans.emplace_back(sum);
  }
  return ans;
}