Submission #839522

#	Time	Username	Problem	Language	Result	Execution time	Memory
839522		model_code	A Plus B (IOI23_aplusb)	C++17	100 / 100	67 ms	7332 KiB

aplusb

// model_solution/solution.cpp

#include "aplusb.h"

#include <vector>
#include <set>

std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
	std::set<std::pair<int,int>> szet; szet.clear();
	std::vector<int> pos(N);
	for(int i=0; i<N; i++){
		pos[i] = 0;
		szet.insert({A[i]+B[0],i});
	}

	std::vector<int> ans(N);
	for(int i=0; i<N; i++){
		auto it = szet.begin();
		ans[i] = (*it).first;
		int id = (*it).second;
		szet.erase(szet.begin());
		if(++pos[id] < N) szet.insert({A[id] + B[pos[id]], id});
	}
	return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40