Quiz/10816_binarySearch.cpp at main · sangjun12458/Quiz · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include <algorithm>
#define MAX 500000

using namespace std;

int n, m;
int my[MAX], arr[MAX];

void input()
{
    cin >> n;
    for (int i = 0; i < n; i++) cin >> my[i];
    cin >> m;
    for (int i = 0; i < m; i++) cin >> arr[i];
}

int main()
{
    input();
    sort(my, my + n);

    for (int i = 0; i < m; i++)
    {
        int x = 1;
        int y = 0;

        int start = 0;
        int end = n - 1;

        while (start <= end)
        {
            int mid = (start + end) / 2;
            if (arr[i] == my[mid]) {
                x = mid;
                end = mid - 1;
            } else if (arr[i] < my[mid]) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }

        start = 0;
        end = n - 1;

        while (start <= end)
        {
            int mid = (start + end) / 2;
            if (arr[i] == my[mid]) {
                y = mid;
                start = mid + 1;
            } else if (arr[i] < my[mid]) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }

        cout << y - x + 1 << '\n';
    }

    return 0;
}