Problem:
Score : 400 points

Problem Statement

There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.

You can take and complete at most one of these jobs in a day.

However, you cannot retake a job that you have already done.

Find the maximum total reward that you can earn no later than M days from today.

You can already start working today.

Constraints

All values in input are integers.

1 \leq N \leq 10^5

1 \leq M \leq 10^5

1 \leq A_i \leq 10^5

1 \leq B_i \leq 10^4

Input

Input is given from Standard Input in the following format:

N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N

Output

Print the maximum total reward that you can earn no later than M days from today.

Sample Input 1

3 4
4 3
4 1
2 2

Sample Output 1

5

You can earn the total reward of 5 by taking the jobs as follows:

Take and complete the first job today. You will earn the reward of 3 after four days from today.

Take and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.

Sample Input 2

5 3
1 2
1 3
1 4
2 1
2 3

Sample Output 2

10

Sample Input 3

1 1
2 1

Sample Output 3

0

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

"use strict";
    
class PriorityQueue {
  constructor() {
    this.heap = [];
  }
 
  push(item) {
    let heap = this.heap;
    let i = heap.length++;
    let j;
 
    while(i) {
      j = Math.floor((i - 1) / 2);
      if(heap[j] <= item) break;
      heap[i] = heap[j]
      i = j;
    }
 
    heap[i] = item;
  }
 
  pop() {
    let heap = this.heap;
    let top = heap[0];
    let popped = heap.pop();
 
    let i = 0;
    let k = Math.floor(heap.length / 2);
    let j;
 
    while(i < k) {
      j = (i * 2) + 1;
      if(heap[j+1] < heap[j]) ++j;
 
      if(popped <= heap[j]) break;
 
      heap[i] = heap[j];
 
      i = j;
    }
 
    if(heap.length) {
      heap[i] = popped;
    }
 
    return top;
  }
 
  size() {
    return this.heap.length;
  }
 
  top() {
    return this.heap[0];
  }
}

const main = arg => {
    arg = arg.trim().split("\n");
    const N = parseInt(arg[0].split(" ")[0]);
    const M = parseInt(arg[0].split(" ")[1]);
    
    let AB = arg.slice(1, N + 1).map(n=>n.split(" ").map(l=>parseInt(l)));
    AB.push([1e9, 0]);
    AB.sort((a,b)=>a[0]-b[0]);
    
    let answer = 0;
    let j = 0;
    
    let pq = new PriorityQueue();
    
    for(let i=1; i<=M; i++) {
        const payDay = AB[j][0];
        const reward = AB[j][1];
        
        while(payDay <= i) {
            pq.push(-reward);
            j++;
        }
        
        if(pq.size() > 0) {
            answer += pq.pop();
        }
    }
    
    console.log(answer * -1);
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));