提交时间:2024-10-04 12:28:04

运行 ID: 33037

#include<bits/stdc++.h> using namespace std; #define ll long long const int N=1e5+10,INF=-0x3f3f3f3f; int n,k,a[N]; ll sum; ll ans; ll cur; signed main(){ ans=INF; scanf("%d%d",&n,&k); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); sum+=a[i]; } ans=max(ans,sum-a[1]+(a[1]|k)); for(int i=2;i<=n;i++){ cur=sum-a[i]+(a[i]|k); ans=max(ans,cur); } printf("%lld",ans); return 0; }