Submission

Score: 15

User: GGEZLOLx3D

Problemset: แคง (Kang)

Language: cpp

Time: 2.093 second

Submitted On: 2026-03-26 22:01:52

#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;vector<long long> nig;
    for(i=0;i<B.size();i++){
        su+=B[i];
        if(i!=0){
            if(mp[B[i]]==0){
            nig.push_back(B[i]);
            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);
            continue;
        }
        else{
            auto it=lower_bound(nig.begin(),nig.end(),B[i]);
            int pig=it-nig.begin();
            nig[pig]+=B[i];
            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);
            continue;
        }
        }

        mp[B[i]]+=B[i];
        if(i==0){


            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;
}