Submission #1357946

#TimeUsernameProblemLanguageResultExecution timeMemory
1357946vjudge1A Plus B (IOI23_aplusb)C++20
60 / 100
1108 ms473464 KiB
#include "aplusb.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> ans;
priority_queue<int,vector<int>,greater<int>> pq;
std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
	int l=1,r=N;
    /*while(l<r){
        int mid=(l+r)/2;
        if(mid*mid+mid>=2*N)r=mid;
        else l=mid+1;
    }*/
    int cnt=N;
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            if(i*j<N)pq.push(A[i]+B[j]);
        }
    }
    while(!pq.empty() && cnt--){
        ans.push_back(pq.top());
        pq.pop();
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...