Submission #19025277

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
	int n,m;
	std::cin >> n >> m;
	std::vector<int> a(n),b(m);
	for(int i = 0; i < n; i++) std::cin >> a[i];
	std::sort(a.begin(), a.end());
	for(int i = 0; i < m; i++) std::cin >> b[i];
	std::sort(b.begin(), b.end());
	for(int i = 0; i < n; i++){
		if(i > 0 && a[i-1] == a[i]) continue;
		if(std::lower_bound(b.begin(), b.end(),a[i]) != std::upper_bound(b.begin(), b.end(),a[i]))
			std::cout << a[i] << "\n";
	}
	return 0;
}

Submission Info

Judge Result