CF988A.Diverse Team

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

There are $n$ students in a school class, the rating of the $i$ -th student on Codehorses is $a_i$ . You have to form a team consisting of $k$ students ( $1 \le k \le n$ ) such that the ratings of all team members are distinct.

If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print $k$ distinct numbers which should be the indices of students in the team you form. If there are multiple answers, print any of them.

输入格式

The first line contains two integers $n$ and $k$ ( $1 \le k \le n \le 100$ ) — the number of students and the size of the team you have to form.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 100$ ), where $a_i$ is the rating of $i$ -th student.

输出格式

If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print $k$ distinct integers from $1$ to $n$ which should be the indices of students in the team you form. All the ratings of the students in the team should be distinct. You may print the indices in any order. If there are multiple answers, print any of them.

Assume that the students are numbered from $1$ to $n$ .

输入输出样例

输入#1
```
5 3
15 13 15 15 12
```
输出#1
```
YES
1 2 5 
```
输入#2
```
5 4
15 13 15 15 12
```
输出#2
```
NO
```
输入#3
```
4 4
20 10 40 30
```
输出#3
```
YES
1 2 3 4 
```

说明/提示

All possible answers for the first example:

{1 2 5}
{2 3 5}
{2 4 5}

Note that the order does not matter.

首页