Submission

Score: 15

User: Zonezonee

Problemset: แคง (Kang)

Language: cpp

Time: 2.100 second

Submitted On: 2026-02-28 20:59:10

#include <bits/stdc++.h>

std::vector<long long> capsize(std::vector<int> A, std::vector<int> B) {
  using namespace std;
  using ll = long long;
  vector<ll> res;
  map<ll,int> mp;
  ll sum = 0;
  for(int i : A) mp[i]++, sum += i;
  for(int i = 0; i < B.size(); ++i){
    int x = B[i];
    mp[x]++;
    sum += x;
    vector<ll> t;
    for(auto [a, b] : mp) t.push_back(a*b);
    sort(t.begin(), t.end(), greater<ll>());
    ll rem = 0;
    for(int j = 0; j <= i; ++j){
      rem += t[j];
    }
    res.push_back(sum-rem);
  }
  return res;
}