Finding Floor of an Element in a Sorted array

Floor.cpp

/*!
* Finding Floor of an Element in a Sorted array
*/

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

int main(){

    ios :: sync_with_stdio(false);
    cin.tie(0);

    vector<int> arr = {1, 2, 3, 4, 7, 10, 14};
    int f = 13;
    int res;

    int l=0, h=arr.size()-1, mid;
    while(l <= h){
        mid = l + (h-l)/2;
        if(f >= arr[mid]){
            res = arr[mid];
            l = mid+1;
        }
        else {
            h = mid-1;
        }
    }

    cout << res << "\n";

    return 0;
}