[C/C++] 백준 1269

문제 소스 코드 #include <iostream> #include <vector> #define MIN(x,y) x < y ? x : y #define MAX(x,y) x > y ? x : y using namespace std; vector<vector<int> > set1(200001); vector<vector<int> > set2(200001); int cnt = 0; int main() { int n1, n2; scanf("%d %d", &n1, &n2); for(int i=0;i<n1;i++) { int num1; scanf("%d", &num1); set1[num1%200001].push_back(num1); } for(int j=0;j<n2;j++) { int num2; scanf("%d", &num2); set2[num2%200001].push_back(num2); } for(int k=0;k<200001;k++) { if(set1[k].size() > set2[k...

원문링크 : [C/C++] 백준 1269