| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357898 | ken | A Plus B (IOI23_aplusb) | C++20 | 0 ms | 0 KiB |
#include "aplusb.h"
#include <cassert>
#include <cstdio>
#include "aplusb.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
int pta = 1;
int ptb = 1;
int n = N;
//cout << pta << " " << ptb << "\n";
vector <int> ann;
for (int i=0; i<n; i++){
for (int j=0; j<n; j++){
ann.push_back(A[i] + B[j]);
}
}
sort(ann.begin(),ann.end());
vector <int> ans;
for (int i=0; i<ann.size() && i < N; i++){
ans.push_back(ann[i]);
}
return ans;
}
int main() {
int N;
assert(1 == scanf("%d", &N));
std::vector<int> A(N);
for (int i = 0; i < N; ++i)
assert(1 == scanf("%d", &A[i]));
std::vector<int> B(N);
for (int i = 0; i < N; ++i)
assert(1 == scanf("%d", &B[i]));
fclose(stdin);
std::vector<int> res = smallest_sums(N, A, B);
int n = res.size();
for (int i = 0; i < n; ++i) {
if (i > 0)
printf(" ");
printf("%d", res[i]);
}
printf("\n");
fclose(stdout);
return 0;
}
