bzoj2460 [BeiJing2011]元素（贪心+线性基）

同bzoj3105：portal

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline ll read(){
    ll x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,ans=0;
ll b[N];
struct data{
    ll x;int v;
    friend bool operator<(data a,data b){return a.v>b.v;}
}a[N];
inline bool ins(ll x){
    for(int i=60;i>=0;--i){
        if(!(x>>i&1)) continue;
        if(!b[i]){b[i]=x;return 1;}
        x^=b[i];
    }return 0;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();
    for(int i=1;i<=n;++i) a[i].x=read(),a[i].v=read();sort(a+1,a+n+1);
    for(int i=1;i<=n;++i) if(ins(a[i].x)) ans+=a[i].v;
    printf("%d\n",ans);
    return 0;
}