#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<int> smallest_sums(int N, vector<int> A, vector<int> B){
// 1 2 2 3 4 5 5
// 5 6 6 7 8 10 12
int i = 0;
int j = 0;
int sz = 0;
vector<int> ans;
while(sz<N and i<N and j<N){
ans.push_back(A[i] + B[j]);
sz++;
if(A[i] + B[j+1] < A[i+1] + B[j]){
j++;
}else if(A[i]+B[j+1]==A[i+1]+B[j]){
i++;
ans.push_back(A[i]+B[j+1]);
sz++;
}else i++;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - expected: 1 tokens, found 2 tokens |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - expected: 1 tokens, found 2 tokens |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - expected: 1 tokens, found 2 tokens |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - expected: 1 tokens, found 2 tokens |
2 |
Halted |
0 ms |
0 KB |
- |