Submission

Score: 48

User: GGEZLOLx3D

Problemset: แคง (Kang)

Language: cpp

Time: 2.094 second

Submitted On: 2026-03-26 21:53:41

#include<bits/stdc++.h>
#include "kang.h"
using namespace std;
map<long long,long long> mp;
vector<long long> capsize(vector<int> A,vector<int> B) {
    vector<pair<long long,long long>> arr;
    long long i,j;
    sort(A.begin(),A.end());
    long long gon=A[0];
    long long sum=A[0];long long su=0;
    for(i=0;i<A.size();i++){
        mp[A[i]]+=A[i];
        su+=A[i];
    }
    vector<long long> ka;
    for(i=0;i<B.size();i++){
        su+=B[i];
        mp[B[i]]+=B[i];
        vector<long long> nig;
        for(auto [u,v]:mp){
            nig.push_back(v);
        }
        sort(nig.begin(),nig.end(),greater<>());
        long long ans=su,cou=0;
        for(j=0;j<nig.size();j++){
            cou++;
            if(cou>i+1)break;
            ans-=nig[j];
        }
        ka.push_back(ans);
    }
  return ka;
}