So easy
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 593 Accepted Submission(s): 324
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
读入
排序
去重
匹配
END
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int n;
vector<int> a, b;
int main(){
while( EOF != scanf("%d", &n) ){
a.clear();
b.clear();
for(int i=0, x; i<n; i++)
scanf("%d", &x), a.push_back(x);
for(int i=0, x; i<n; i++)
scanf("%d", &x), b.push_back(x);
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int al = unique(a.begin(), a.end()) - a.begin();
int bl = unique(b.begin(), b.end()) - b.begin();
int flag = 0, i;
if( al==bl ){
for(i=0; i<al && a[i]==b[i]; i++);
flag = i==al;
}
printf("%s\n", flag ? "YES":"NO");
}
return 0;
}