제출 #839537

#제출 시각아이디문제언어결과실행 시간메모리
839537model_codeA Plus B (IOI23_aplusb)C++17
60 / 100
490 ms564228 KiB
// incorrect/sol-birka0-wa-faster.cpp

#include "aplusb.h"

#include <algorithm>

using namespace std;

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    int X = min(N, 12000);
    vector<int> C(X*X);
	for(int i=0; i<X; i++){
		for(int j=0; j<X; j++) C[i*X+j] = A[i]+B[j];
	}
	partial_sort(C.begin(), C.begin() + N, C.end());

	return vector<int>(C.begin(), C.begin() + N);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...