思路:左右排序,排序之后相加对比是否相等
代码:
<span style="font-size:14px;">#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstring>
#include<ctime>
#include<algorithm>
using namespace std;
int a[500005],b[500005];
int main()
{
int all;
while(cin>>all)
{
if(all==0) break; //第一个数据为0退出循环
for(int i=0;i<all;i++)
{
cin>>a[i]>>b[i];
}
sort(a,a+all);
sort(b,b+all);
int yes = 1;
for(int i=0;i<all;i++)
{
if(a[i] != b[i]) yes = 0;
}
if (yes) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
} </span>