Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int limeout[700050];
- int findnumlime(int x,int n){
- int ans = 0;
- int l=1,r=n;
- while(l<=r){
- int m = (l+r)/2;
- if(limeout[m]-m<x){
- ans =m;
- l=m+1;
- }
- else{
- r=m-1;
- }
- }
- ans+=x;
- return ans;
- }
- int main(){
- int n , k;
- scanf("%d%d",&n,&k);
- for(int i=1;i<=n;++i){
- scanf("%d",&limeout[i]);
- }
- int x;
- sort(limeout,limeout+n+1);
- for(int i=0;i<k;++i){
- scanf("%d",&x);
- int y=findnumlime(x,n);
- printf("%d ",y);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement