#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <vector>
std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
std::vector<int> result = std::vector<int>(N);
int *BI = new int[N];
memset(BI, 0, N*sizeof(int));
for(int RI = 0; RI < N; RI++) {
int LI = INT32_MAX, min = INT32_MAX, minidx;
for(int AI = 0; AI < N; AI++) {
if(BI[AI] >= LI) break;
int sum = A[AI] + B[BI[AI]];
if(sum < min) {
min = sum;
minidx = AI;
}
LI = BI[AI];
}
BI[minidx] ++;
result[RI] = min;
}
delete [] BI;
return result;
}
