Advertisement
anhkiet2507

Untitled

Mar 22nd, 2022
2,159
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.83 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define MAX 100
  3. using namespace std;
  4. long long TimKiemNhiPhan(vector <long long> arr, long long l, long long r, long long x){
  5.     if(r >= l){
  6.         long long mid = (l+r)/2;
  7.         if(arr[mid] == x){
  8.             return mid+1;
  9.         }
  10.         if(arr[mid] > x){
  11.             return TimKiemNhiPhan(arr, l, mid-1, x);
  12.         }
  13.         return TimKiemNhiPhan(arr, mid+1, r, x);
  14.     }
  15.     return -1;
  16. }
  17. int main(){
  18.     int t; cin >> t;
  19.     while(t--){
  20.         long long n; cin >> n;
  21.         vector<long long> arr;
  22.        
  23.         for(long long i = 0; i < n; i++){
  24.             long long temp; cin >> temp;
  25.             arr.push_back(temp);
  26.         }
  27.         vector<long long> arr2 = arr;
  28.         for(long long i = 0; i < n - 1; i++){
  29.             long long temp2; cin >> temp2;
  30.             arr.erase(remove(arr.begin(), arr.end(), temp2),arr.end());
  31.         }
  32.         long long diff = arr[0];
  33.         cout << TimKiemNhiPhan(arr2, 0, n-1, diff) << endl;
  34.     }
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement