Foreign Exchange (UVA - 10763)

版权声明：欢迎转载!拒绝抄袭. https://blog.csdn.net/qq_36257146/article/details/87440679

#include <iostream>
#include <bits/stdc++.h>
#define maxn 500002
using namespace std;

int N1[maxn];
int N2[maxn];

int main()
{
    int n;
    int a,b;
    while(cin>>n&&n!=0)
    {
        int ok = 1;
        for(int i = 0;i<n;i++)
        {
            cin>>N1[i]>>N2[i];
        }
        if(n%2)
        {
            cout<<"NO"<<endl;
            continue;
        }
        sort(N1,N1+n);
        sort(N2,N2+n);
        for(int i = 0;i<n;i++)
        {
            if(N1[i]!=N2[i])
            {
                ok = 0;
                break;
            }
        }
        if(ok) cout<<"YES"<<endl;
        else  cout<<"NO"<<endl;
    }
    return 0;
}