| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1357843 | po_rag526 | A Plus B (IOI23_aplusb) | C++20 | 1120 ms | 1051488 KiB |
#include <bits/stdc++.h>
using namespace std;
#include "aplusb.h"
std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
vector<int>ret;
priority_queue<int>pq;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
pq.push(-(A[i]+B[j]));
}
}
while(ret.size()<N){
ret.push_back(-pq.top());
pq.pop();
}
return ret;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
