Problem Description
Small W gets two files. There are n integers in each file. Small W wants to know whether these two files are same. So he invites you to write a program to check whether these two files are same. Small W thinks that two files are same when they have the same integer set.
For example file A contains (5,3,7,7),and file B contains (7,5,3,3). They have the same integer set (3,5,7), so they are same.
Another sample file C contains(2,5,2,5), and file D contains (2,5,2,3).
The integer set of C is (2,5),but the integer set of D is (2,3,5),so they are not same.
Now you are expected to write a program to compare two files with size of n.
Input
Multi test cases (about 100). Each case contain three lines. The first line contains one integer n represents the size of file. The second line contains n integers
a1,a2,a3,…,an
- represents the content of the first file. The third line contains n integers
b1,b2,b3,…,bn
- represents the content of the second file. Process to the end of file.
1≤n≤100
1≤ai,bi≤1000000000
Output
For each case, output “YES” (without quote) if these two files are same, otherwise output “NO” (without quote).
Sample Input
3
1 1 2
1 2 2
4
5 3 7 7
7 5 3 3
4
2 5 2 3
2 5 2 5
3
1 2 3
1 2 4
Sample Output
YES
YES
NO
NO
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <set>
#include <math.h>
#include <algorithm>
#include <queue>
#include <iomanip>
#define INF 0x3f3f3f3f
#define MAXN 6005
#define Mod 99999999
using namespace std;
set<long long> a,b;
int main()
{
int n;
while(~scanf("%d",&n))
{
a.clear();
b.clear();
long long x;
for(int i=0;i<n;++i)
{
scanf("%I64d",&x);
a.insert(x);
}
for(int i=0;i<n;++i)
{
scanf("%I64d",&x);
b.insert(x);
}
set<long long>::iterator ia,ib;
if(a.size()!=b.size())
{
printf("NO\n");
continue;
}
int flag=0;
for(ia=a.begin(),ib=b.begin();ia!=a.end();++ia,++ib)
{
if(*ia!=*ib)
{
flag=1;
break;
}
}
if(flag)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}