【codevs1230】元素查找

problem

• 給出n個正整數，然后有m個詢問
• 詢問該整數是否在n個正整數中出現過

solution

哈希表？
當然是set水洛

codes

#include<iostream>
#include<set>
using namespace std;
set<int>s;
int main(){int n, m;cin>>n>>m;for(int i = 1; i <= n; i++){int x;  cin>>x;  s.insert(x);}for(int i = 1; i <= m; i++){int x;  cin>>x;if(s.count(x))cout<<"YES\n";else cout<<"NO\n";}return 0;
}