Submission

Score: 43

User: qweqwe

Problemset: แคง (Kang)

Language: cpp

Time: 2.084 second

Submitted On: 2026-03-26 21:10:19

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
using db = long double;

vector<long long> capsize(vector<int> a, vector<int> b) {
	int n=a.size(),m=b.size();
	multiset<ll> contri;
	vector<ll> ans;
	ll sum=0;
	unordered_map<ll,ll> cnt;
	for (int i:a){
		if (cnt[i]){
			contri.erase(cnt[i]*i);
		}
		cnt[i]++;
		contri.insert(cnt[i]*i);
		sum+=i;
	}
	for (int i=0;i<m;i++){
		if (cnt[b[i]]){
			contri.erase(cnt[b[i]]*b[i]);
		}
		cnt[b[i]]++;
		contri.insert(cnt[b[i]]*b[i]);
		sum+=b[i];
		
		ll temp=sum;
		ll k = i+1;
		auto it=contri.rbegin();
		
		while (k-- && it!=contri.rend()){
			temp-=(*it);++it;
		}
		if (it==contri.rend()){
			ans.push_back(0);
		}ans.push_back(temp);
	}
	return ans;
}
/*
5 4
6 3 9 6 3
4 6 9 6

19 10 4 0

8 7
1 2 3 4 5 6 7 8
9 10 11 12 13 14 15

5 4
32 78 4 10 9
52 46 33 77

5 4
1 2 3 4 5
4 4 4 4
*/