Submission

Score: 100

User: KantaponZ

Problemset: แคง (Kang)

Language: cpp

Time: 1.367 second

Submitted On: 2025-06-30 20:20:41

#include <bits/stdc++.h>
using namespace std;

#define ll long long

unordered_map<ll,ll> cnt;
unordered_map<ll,bool> del;
vector<ll> C;
priority_queue<pair<ll, ll>> pq;

vector<long long> capsize(vector<int> A, vector<int> B) {
      
    C.reserve((int)B.size());
    cnt.reserve((int)(A.size()+B.size()));
    del.reserve((int)(A.size()+B.size()));
    int N = A.size(), M = B.size();
    ll sum = 0;
    for (int i = 0; i < N; i++) {
        A[i] *= 1LL;
        sum += A[i];
        cnt[A[i]]++;
    }
    for (auto [k, v] : cnt) {
        pq.push({k * v, k});
    }
    for (int i = 0; i < M; i++) {
        if (sum <= 0 || pq.empty()) {
          break;
        }
        B[i] *= 1LL;
        if (!del[B[i]]) {
            sum += B[i];
            cnt[B[i]]++;
            pq.push({B[i] * cnt[B[i]], B[i]});
        }
        
        while (!pq.empty() && (del[pq.top().second])) {
            pq.pop();
        }
        sum -= pq.top().first;
        del[pq.top().second] = 1;
        pq.pop();
        
        C.emplace_back(max(sum, 0 * 1LL));
    }
    
    for (int i = C.size(); i < M; i++) {
        C.emplace_back(0);
    }
    
    return C;
}