Codeforces Round #813 (Div. 2) 题解 (A~C)

A. Wonderful Permutation

time limit per test: 1 second
memory limit per test: 256 megabytes
input: standard input
output: standard output

Problem Statement

You are given a permutation $p_1,p_2,\dots ,p_n$ of length n and a positive integer $k\le n$.

In one operation you can choose two indices $i$ and $j$ $(1\le i<j\le n)$ and swap $p_i$ with $p_j$.

Find the minimum number of operations needed to make the sum $p_1+p_2+\dots +p_k$ as small as possible.

A permutation is an array consisting of $n$ distinct integers from 1 to $n$ in arbitrary order. For example, $[2,3,1,5,4]$ is a permutation, but $[1,2,2]$ is not a permutation ($2$ appears twice in the array) and $[1,3,4]$ is also not a permutation ($n=3$ but there is $4$ in the array).

题面翻译

给出一个长度为$n$的排列$p_1,p_2,...,p_n$和一个正整数$k$。

在每一次操作中，你可以交换任意的$a_i,a_j(1\le i,j\le n)$。

求当$p_1+p_2+...+p_k$最小时，最少的操作次数。

定义：排列是指有$1$至$n$组成的任意排序。例如，$[2,3,1,5,4]$是一个排列，但$[1,2,2]$不是排列($2$在数组中出现两次)，$[1,3,4]$也不是排列($n=3$但$4$也在数组中)。

Input

Each test contains multiple test cases. The first line contains the number of test cases $t(1\le t\le 100)$. Description of the test cases follows.

The first line of each test case contains two integers $n$ and $k(1\le k\le n\le 100)$.

The second line of each test case contains $n$ integers $p_1,p_2,\dots ,p_n(1\le p_i\le n)$. It is guaranteed that the given numbers form a permutation of length $n$.

Output

For each test case print one integer — the minimum number of operations needed to make the sum $p_1+p_2+\dots +p_k$