https://codeforces.com/problemset/problem/1210/B
it can be discovered:
To form a group, two people must have the same skill tree.
So first group the groups that can form a group, and then pull in all the subsets, paying attention not to be a duplication. Statistics is the answer
#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=7e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar(); while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn];
map<LL,LL>map1;
bool vis[maxn];
int main(void)
{
cin.tie(0);std::ios::sync_with_stdio(false);
LL n;cin>>n;
for(LL i=1;i<=n;i++) cin>>a[i];
for(LL i=1;i<=n;i++) cin>>b[i];
for(LL i=1;i<=n;i++){
for(LL j=i+1;j<=n;j++){
if(a[i]==a[j]){
map1[a[i]]++;
}
}
}
LL ans=0;
for(auto i:map1){
if(i.second>=1){
LL temp=i.first;
for(LL j=1;j<=n;j++){
if( !vis[j]&&(temp|a[j])==temp){
ans+=b[j];
vis[j]=1;
}
}
}
}
cout<<ans<<"\n";
return 0;
}