A Fundraising Problem

View as PDF

Submit solution

Points: 12 (partial)
Time limit: 2.0s
Memory limit: 162M

Problem types

N people want to donate money to DMOJ. Each person has one person that they hate though, so they will not donate money if the person they hate donates to DMOJ.

Compute the maximum amount of money that DMOJ can receive.


1 \le N \le 10^6

a_i \le 10^6

Input Specification

The first line contains a single integer, N.

The next N lines contain two space-separated integers. The first is the amount of money person i will donate, a_i. The second is the index of the person they hate, which will be one-indexed.

Output Specification

Output the desired total.

Sample Input

10 2
20 3
30 1

Sample Output



There are no comments at the moment.