IntegerotS

AtCoder

IDtenka1_2017_d

Time2000ms

Memory256MB

Difficulty—

_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$ [samples]

Samples

Input #1

Output #1

8

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

Input #2

Output #2

9

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

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "IntegerotS",
    "description": {
      "content": "_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 differe",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "tenka1_2017_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "_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 differe...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments