我是帮助你解题的麻辣毛豆！！！
给个赞行不行......

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[1001]={};
    int xr=0;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
        xr^=arr[i];
    }
    sort(arr+1,arr+n+1);
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if((arr[i]^arr[j])==0){
                arr[i]=arr[j]=0;
            }if((arr[i]^arr[j])==xr){
                if(arr[i]==arr[i-1]||arr[i]==arr[i+1]||arr[j]==arr[j-1]||arr[j]==arr[j+1])continue;
                cout<<min(arr[i],arr[j])<<" "<<max(arr[i],arr[j]);
                return 0;
            }
        }
    }
}