Queries about less or equal elements

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <int >v,r,ans;
int n,y;

int binarySearch(int val,ll left=0,ll right=r.size()-1){
    ll middle,ans1=0;
    while(left<=right){
            middle=right+left/2;
        if (r[middle]<=val && r[middle+1]>val){
            return middle+1;
        }
        else if (r[middle]>val){
            right=middle-1;
        }
        else{
            left=middle+1;
            ans1=middle+1;
        }
    }
    return ans1;
}


    pair<int,int>p;


int main()
{
    int z;
    cin>>n>>y;
    bool c=0;
    for (int i=0;i<n;++i){
        cin>>z;
        r.push_back(z);
    }
    sort(r.begin(),r.end());
    for (int i=0;i<y;++i){
        cin>>z;
        ans.push_back(binarySearch(z));
    }
    for (int i:ans) cout<<i<<" ";
}