Mock CCO '19 Contest 2 Problem 6 - A Fundraising Problem

View as PDF

Submit solution

All submissions

Best submissions

Points: 12 (partial)

Time limit: 1.0s

Memory limit: 162M

Problem types

$N$ ~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.

Constraints

$1 \le N \le 10^6$ ~1 \le N \le 10^6~

$a_i \le 10^6$ ~a_i \le 10^6~

Input Specification

The first line contains a single integer, $N$ ~N~.

The next $N$ ~N~ lines contain two space-separated integers. The first is the amount of money person $i$ ~i~ will donate, $a_i$ ~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

Sample Output

Comments

11

discoverMe commented on May 25, 2019, 10:12 p.m.

unlike in real life you can't hate yourself

2

Darcy___Liu commented on May 26, 2019, 4:03 a.m. ← edited →

WOW LITRALLY ME IRL