提交时间:2024-10-04 12:32:31

运行 ID: 33050

#include<bits/stdc++.h> using namespace std; long long n,k,sum,ans; long long a[100005]; int main(){ // freopen("xor.in","r",stdin); // freopen("xor.out","w",stdout); scanf("%lld%lld",&n,&k); for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); sum+=a[i]; } for(int i=1;i<=n;i++){ ans=max(ans,sum-a[i]+(a[i]^k)); } printf("%lld",ans); }