Submission #1067165

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067165		ChericMAC	A Plus B (IOI23_aplusb)	C++17	60 / 100	1095 ms	1051240 KiB

aplusb

#include <aplusb.h>
#include <queue>
#include <algorithm>
using namespace std;

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    priority_queue<int, vector<int>, greater<int>> C;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            C.push(A[i] + B[j]);
        }
    }
    vector<int> result;
    while (N--) {
        result.push_back(C.top());
        C.pop();
    }
    return result;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 0 / 40