19 lines
368 B
C++
19 lines
368 B
C++
#include <iostream>
|
|
#include <unordered_map>
|
|
using namespace std;
|
|
int main(){
|
|
unordered_map<int, int> a;
|
|
int n, m;
|
|
cin >> n >> m;
|
|
int tmp;
|
|
for(int i = 0; i < n; i++){
|
|
cin >> tmp;
|
|
a.emplace(make_pair(i + 1, tmp));
|
|
}
|
|
for(int i = 0; i < m; i++){
|
|
cin >> tmp;
|
|
cout << a.find(tmp)->second << endl;
|
|
}
|
|
return 0;
|
|
}
|