Submission

Score: 48

User: kungarooo

Problemset: แคง (Kang)

Language: cpp

Time: 2.084 second

Submitted On: 2025-08-02 22:45:47

#include <bits/stdc++.h>
using namespace std;
long long int sum=0;
unordered_map<long long int,long long int> c;
long long wdym(int d){
    priority_queue<long long int> pq;
    for(auto i:c){
        pq.push(i.second);
    }
    long long int sub=0;
    for(int i=0;i<d&&!pq.empty();i++){
        sub+=pq.top();
        pq.pop();
    }
    return sum-sub;
}
std::vector<long long> capsize(std::vector<int> A, std::vector<int> B){
    int m=B.size();
    
    sort(A.begin(),A.end());
    vector<int> BB=B;
    sort(BB.begin(),BB.end());
    for(int i=0;i<A.size();){
        int idx=i;
        while(++i<A.size()&&A[i]==A[idx]){}
        c[A[idx]]=A[idx]*((long long int)(i-idx));
        sum+=A[idx]*((long long int)(i-idx));
    }
    for(int i=0;i<BB.size();){
        int idx=i;
        while(++i<BB.size()&&BB[i]==BB[idx]){}
        c[BB[idx]]+=BB[idx]*((long long int)(i-idx));
        sum+=BB[idx]*((long long int)(i-idx));
    }
    // for(auto i:c){
    //     cout<<i.first<<" "<<i.second<<"\n";
    // }
    vector<long long> ret;
    for(int i=m;i>=1;i--){
        ret.push_back(wdym(i));
        c[B[i-1]]-=B[i-1];
        sum-=B[i-1];
    }
    reverse(ret.begin(),ret.end());
    return ret;
}
// int32_t main(){
//     int n, m;
//     cin >> n >> m;
//     vector<int> A(n), B(m);
//     for(auto &x: A) cin >> x;
//     for(auto &x: B) cin >> x;
//     vector<long long> ans =  capsize(A,B);
//     for(auto x: ans){
//         cout << x <<" ";
//     }
// }
/*
5 4
6 3 9 6 3
4 6 9 6
*/