23870번 - Paired Up 다국어

There are a total of $N$ ($1\le N\le 5000$) cows on the number line, each of which is a Holstein or a Guernsey. The breed of the $i$-th cow is given by $b_i\in \{H,G\}$, the location of the $i$-th cow is given by $x_i$ ($0 \leq x_i \leq 10^9$), and the weight of the $i$-th cow is given by $y_i$ ($1 \leq y_i \leq 10^5$).

At Farmer John's signal, some of the cows will form pairs such that

• Every pair consists of a Holstein $h$ and a Guernsey $g$ whose locations are within $K$ of each other ($1\le K\le 10^9$); that is, $|x_h-x_g|\le K$.
• Every cow is either part of a single pair or not part of a pair.
• The pairing is maximal; that is, no two unpaired cows can form a pair.

It's up to you to determine the range of possible sums of weights of the unpaired cows. Specifically,

• If $T=1$, compute the minimum possible sum of weights of the unpaired cows.
• If $T=2$, compute the maximum possible sum of weights of the unpaired cows.

The first input line contains $T$, $N$, and $K$.

Following this are $N$ lines, the $i$-th of which contains $b_i,x_i,y_i$. It is guaranteed that $0\le x_1< x_2< \cdots< x_N\le 10^9$.

The minimum or maximum possible sum of weights of the unpaired cows.