제출 #1067174

#제출 시각아이디문제언어결과실행 시간메모리
1067174ChericMACA Plus B (IOI23_aplusb)C++17
10 / 100
0 ms348 KiB
#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 / 2 + 1; j++) { C.push(A[i] + B[j]); } } vector<int> result; while (N--) { result.push_back(C.top()); C.pop(); } return result; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...