제출 #880268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
880268		Mardonbekhazratov	A Plus B (IOI23_aplusb)	C++17	100 / 100	130 ms	4480 KiB

aplusb

#include "aplusb.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
 
vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
	sort(A.begin(),A.end());
	sort(B.begin(),B.end());
	ll l=-1,r=1e18;
	while(r-l>1){
		ll mid=(l+r)/2;
		ll ans=0;
		for(int i=0;i<N;i++){
			ans+=upper_bound(B.begin(),B.end(),mid-A[i])-B.begin();
		}
		if(ans>=N) r=mid;
		else l=mid;
	}
	vector<int> ans(N);
	int j=0;
	for(int i=0;i<N;i++){
		int pos=lower_bound(B.begin(),B.end(),r-A[i])-B.begin();
		for(int k=0;k<pos;k++){
			ans[j++]=A[i]+B[k];
		}
	}
	while(j<N) ans[j++]=r;
	sort(ans.begin(),ans.end());
	return ans;
}

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