CompetitiveProgramming/busqueda at main · Cruzdev0131/CompetitiveProgramming · 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
#include <bits/stdc++.h>
using namespace std;

int bs(int idj,vector<int> &ids){

int l=0, r=ids.size()-1, mita;
while((r-l)>1){
    mita=(l+r)/2;
    if(ids[mita]==idj)return mita;
    else if(ids[mita]>idj)r=mita;
    else if(ids[mita]<idj)l=mita;
}
if(ids[mita]==idj)return mita;
if(ids[l]==idj)return l;
if(ids[r]==idj)return r;
return -1;
}


//vector<int>idsj;

int main(){

     ios_base::sync_with_stdio(0);
  cin.tie(0);
int n,k,id,idj;
vector<int>ids;

cin>>n>>k;
for(int i=0; i<n;  i++){
cin>>id;
ids.push_back(id);

}

for(int j=0; j<k; j++){
    cin>>idj;
   // idsj.push_back(idj);
     int pos=bs(idj, ids);
cout<<pos<<" ";
}


    return 0;
return 0;
}