Problem:
Score : 500 points

Problem Statement

We have N camels numbered 1,2,\ldots,N.
Snuke has decided to make them line up in a row.

The happiness of Camel i will be L_i if it is among the K_i frontmost camels, and R_i otherwise.

Snuke wants to maximize the total happiness of the camels. Find the maximum possible total happiness of the camel.

Solve this problem for each of the T test cases given.

Constraints

All values in input are integers.

1 \leq T \leq 10^5

1 \leq N \leq 2 \times 10^{5}

1 \leq K_i \leq N

1 \leq L_i, R_i \leq 10^9

The sum of values of N in each input file is at most 2 \times 10^5.

Input

Input is given from Standard Input in the following format:

T
\mathrm{case}_1
\vdots
\mathrm{case}_T

Each case is given in the following format:

N
K_1 L_1 R_1
\vdots
K_N L_N R_N

Output

Print T lines. The i-th line should contain the answer to the i-th test case.

Sample Input 1

3
2
1 5 10
2 15 5
3
2 93 78
1 71 59
3 57 96
19
19 23 16
5 90 13
12 85 70
19 67 78
12 16 60
18 48 28
5 4 24
12 97 97
4 57 87
19 91 74
18 100 76
7 86 46
9 100 57
3 76 73
6 84 93
1 6 84
11 75 94
19 15 3
12 11 34

Sample Output 1

25
221
1354

In the first test case, it is optimal to line up the camels in the order 2, 1.

Camel 1 is not the frontmost camel, so its happiness will be 10.

Camel 2 is among the two frontmost camels, so its happiness will be 15.

In the second test case, it is optimal to line up the camels in the order 2, 1, 3.

Camel 1 is among the two frontmost camels, so its happiness will be 93.

Camel 2 is the frontmost camel, so its happiness will be 71.

Camel 3 is among the three frontmost camels, so its happiness will be 57.

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use proconio::input;
use std::collections::BTreeSet;
fn solve(n: usize, cs: Vec<(usize, u64, u64)>) -> u64 {
    // k, l, r
    let mut ls: BTreeSet<(usize, u64, u64)> = BTreeSet::new();
    let mut rs: BTreeSet<(usize, u64, u64)> = BTreeSet::new();

    for (k, l, r) in cs {
        if l > r {
            ls.insert((k, l, r));
        } else {
            // 右にいなきゃいけないやつから詰めるので逆順にする
            rs.insert((n - k, l, r));
        }
    }

    //    println!("{:?}\n{:?}", ls, rs);

    let mut ans = 0;
    {
        // (l-r, idx)
        let mut lc: BTreeSet<(u64, usize)> = BTreeSet::new();
        for (i, (k, l, r)) in ls.iter().enumerate() {
            let val = l - r;
            lc.insert((val, i));
            ans += l;
            // 左から i 番目においてある。i は 0-indexなので足して揃える
            let idx = i + 1;
            // 条件を満たさないとき
            if *k < idx {
                // pop the lowest diff
                let v: Vec<&(u64, usize)> = lc.iter().take(1).collect();
                let (diff, _) = v[0];
                ans -= diff;
                let cloned = v[0].clone();
                lc.remove(&cloned);
            }
        }
    }

    {
        // (r-l, idx)
        let mut rc: BTreeSet<(u64, usize)> = BTreeSet::new();

        for (i, (k, l, r)) in rs.iter().enumerate() {
            let val = r - l;
            rc.insert((val, i));
            ans += r;
            let idx = i + 1;
            // 条件を満たさないとき
            if *k < idx {
                // pop the lowest diff
                let v: Vec<&(u64, usize)> = rc.iter().take(1).collect();
                let (diff, _) = v[0];
                ans -= diff;
                let cloned = v[0].clone();
                rc.remove(&cloned);
            }
        }
    }

    ans
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_solve() {
        let n = 2;
        let cs = vec![(1, 5, 10), (2, 15, 5)];
        assert_eq!(solve(n, cs), 25);

        let n = 3;
        let cs = vec![(2, 93, 78), (1, 71, 59), (3, 57, 96)];
        assert_eq!(solve(n, cs), 221);
    }
}

fn main() {
    input!(t: usize);
    for _ in 0..t {
        input!(n: usize);
        input!(cs: [(usize, u64, u64); n]);
        let ans = solve(n, cs);
        println!("{}", ans);
    }
}
*/

fn main() {
    let exe = "/tmp/bin9DCB3DC2";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";