Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main()
- {
- vector<long long> array;
- vector<long long> zapr;
- int num, k = 0, m;
- int* lmin;
- cin >> num;
- array.resize(num);
- for (int i = 0; i < num; i++)
- {
- cin >> array[i];
- }
- sort(array.begin(), array.end());
- cin >> m;
- zapr.resize(m);
- for (int i = 0; i < m; i++)
- {
- cin >> zapr[i];
- }
- for (int i = 0; i < m; i++)
- {
- int left = 0;
- int right = num;
- int sav = -1;
- while (true)
- {
- int midd = (left + right) / 2;
- if (zapr[i] < array[midd])
- {
- right = midd - 1;
- }
- else if (zapr[i] > array[midd])
- {
- left = midd + 1;
- }
- else
- {
- sav = midd;
- right = midd - 1;
- }
- if (left > right)
- {
- break;
- }
- }
- if (sav != -1) { k += sav; }
- else
- {
- k--;
- }
- }
- cout << k;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement