Submission

Status:

(-SSSSSSSSSSSSS)(P-SSSSSSSSS)(PPPPPPPPP)(-SSSSSSSSS)(PP-SSSSSSS)(TSSSSSSSSSSSSS)(TSSSSSSSSSSSSSSSSSSSSS)

Subtask/Task Score:

{0/5}{0/7}{8/8}{0/12}{0/16}{0/28}{0/24}

Score: 8

User: winwin1054

Problemset: แคง (Kang)

Language: cpp

Time: 2.094 second

Submitted On: 2026-05-31 20:59:56

#include <bits/stdc++.h>
using namespace std;

vector<long long> capsize(vector<int> A, vector<int> B) {
    vector<long long> ans,card;
    long long sum=0;
    for(long long i:A) sum += i,card.push_back(i);
    for(int i=0;i<B.size();i++) {
        sum += B[i];
        card.push_back(B[i]);
        sort(card.begin(),card.end());
        sum -= card[card.size()-1];
        card.pop_back();
        ans.push_back(sum);
    }
    return ans;
}