Problem:
Score : 500 points

Problem Statement

Seisu-ya, a store specializing in non-negative integers, sells N non-negative integers. The i-th integer is A_i and has a utility of B_i.
There may be multiple equal integers with different utilities.

Takahashi will buy some integers in this store. He can buy a combination of integers whose bitwise OR is less than or equal to K. He wants the sum of utilities of purchased integers to be as large as possible.

Find the maximum possible sum of utilities of purchased integers.

Constraints

1 \leq N \leq 10^5

0 \leq K < 2^{30}

0 \leq A_i < 2^{30}(1\leq i\leq N)

1 \leq B_i \leq 10^9(1\leq i\leq N)

All input values are integers.

Inputs

Input is given from Standard Input in the following format:

N K
A_1 B_1
:
A_N B_N

Outputs

Print the maximum possible sum of utilities of purchased integers.

Sample Input 1

3 5
3 3
4 4
2 5

Sample Output 1

8

Buy 2 and 3 to achieve the maximum possible total utility, 8.

Sample Input 2

3 6
3 3
4 4
2 5

Sample Output 2

9

Buy 2 and 4 to achieve the maximum possible total utility, 9.

Sample Input 3

7 14
10 5
7 4
11 4
9 8
3 6
6 2
8 9

Sample Output 3

32

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <map>
#include <algorithm>
#include <vector>
#include <queue>

#define INF 1 << 29
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)

using namespace std;

typedef pair<int,int> s;
vector
 v;
int K1[31]={0};//nbit以下の数字の和
int K2[31]={0};
int abs(int x){
  return x > 0 ? x : -x;
}

int length(char c[]){
  int cnt=0;
  for(cnt=0;c[cnt]!='\0';cnt++){
  }
  return cnt;
}

int n,k,a,b;
int sum=0,sum2=0;
int main(){
  scanf("%d %d",&n,&k);
  REP(i,n){
    scanf("%d %d",&a,&b);
    v.push_back(s(a,b));
  }
  sort(v.begin(), v.end());


  REP(i,31){//abit目以下をフリーにするとK1[a+1]-K1[a]
    if(i==0||(k>>i!=0&&((k>>i)&1))){//ibit目を
      int l=0;
      int tmp=0;
      for(int a=0;a<i;a++){
        l=(l<<1)+1;
      }
      for(int j=0;j<n;j++){
        if(i==0&&(v[j].first|k)==(k|l)){
          tmp+=v[j].second;
        }else if((v[j].first|((k&~(l+1))|l))==((k&~(l+1))|l)){
          tmp+=v[j].second;
        }
      }
      sum = max(sum,tmp);
    }
  }
  printf("%d\n",sum );
}
//1110000000 kbitに1が立っている場合
//110??????? K1[k]