HDU 5058 So easy
签到题,直接set乱搞即可
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
int n;
set<int> s1, s2;
int num[105];
bool judge() {
if (s1.size() != s2.size()) return false;
set<int>::iterator it1 = s1.begin(), it2 = s2.begin();
while (it1 != s1.end() && it2 != s2.end()) {
if (*it1 != *it2) return false;
it1++; it2++;
}
return true;
}
int main() {
while (~scanf("%d", &n)) {
s1.clear(); s2.clear();
int tmp;
for (int i = 0; i < n; i++) {
scanf("%d", &tmp);
s1.insert(tmp);
}
for (int i = 0; i < n; i++) {
scanf("%d", &tmp);
s2.insert(tmp);
}
printf("%s\n", judge() ? "YES" : "NO");
}
return 0;
}