给定一个序列 $a_1, a_2, \dots, a_n$。允许交换相邻的两个数不超过 $k$ 次。
求交换后逆序对数量的最小值（逆序对是指满足 $1 \le i < j \le n$ 且 $a_i > a_j$ 的数对 $(i, j)$ 的数量）。
第一行包含两个整数 $n, k$ ($1 \le n \le 10^5, 0 \le k \le 10^9$)。第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$ ($0 \le a_i \le 10^9$)。
输出逆序对的最小数量。
3 1 2 2 1
1
3 0 2 2 1
2
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: