백준 11663번 선분 위의 점 C++

https://www.acmicpc.net/problem/11663

11663번: 선분 위의 점

 

이분탐색

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long; 

int n, m;
vector<int> v;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m;
    v = vector<int>(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    for (int i = 0; i < m; i++) {
        int s, e;
        cin >> s >> e;
        int left = lower_bound(v.begin(), v.end(), s) - v.begin();
        int right = upper_bound(v.begin(), v.end(), e) - v.begin();
        cout << right - left << "\n";
    }
}