제출 #1123337

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

aplusb

#include <bits/stdc++.h>
#define ll long long
#define tii tuple<int, int, int>
using namespace std;

priority_queue<tii, vector<tii>, greater<tii>> pq;
vector<int> ans;

vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
    pq.push({A[0]+B[0], 0, 0});
    ll l=0, r=2e9;
    while(l < r) {
        ll mid = l+(r-l)/2, cnt = 0;
        for(int i=0; i<N; i++) {
            cnt += upper_bound(B.begin(), B.end(), mid-A[i])-B.begin();
        }
        if(cnt >= N) {
            r = mid;
        } else {
            l = mid+1;
        }
    }
    for(int i=0; i<N; i++) {
        for(int j=0; A[i]+B[j] <= l; j++) {
            ans.push_back(A[i]+B[j]);
        }
    }
    sort(ans.begin(), ans.end());
    while(ans.size() > N) ans.pop_back();
    return ans;
}

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