| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1194018 | exoworldgd | A Plus B (IOI23_aplusb) | C++20 | 1071 ms | 1051336 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
vector<int> sum;
for (int i = 0 ;i < n; i++) {
for (int j = 0 ; j < n ; j++) {
int x;
x = a[i] + b[j];
sum.push_back(x);
}
}
sort(sum.begin(),sum.end());
vector<int> res;
for (int i = 0; i< n; i++) res.push_back(sum[i]);
return res;
}| # | 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... | ||||
