A. Diverse Team_there are n students in a school class,the rating -CSDN博客

本文链接：https://blog.csdn.net/qq_37708702/article/details/89441808

本文介绍了一个编程挑战，任务是在限定条件下从一群学生中挑选出具备不同评分的学生组成团队。通过示例展示了如何判断是否可以成功组建团队，并给出了实现这一目标的代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接
There are n students in a school class, the rating of the i-th student on Codehorses is ai. You have to form a team consisting of k students (1≤k≤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.

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

The second line contains n integers a1,a2,…,an (1≤ai≤100), where ai is the rating of i-th student.

Output
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.

input
5 3
15 13 15 15 12

output
YES
1 2 5

input
5 4
15 13 15 15 12

output
NO

input
4 4
20 10 40 30

output
YES
1 2 3 4

Note
All possible answers for the first example:

{1 2 5}
{2 3 5}
{2 4 5}
Note that the order does not matter.

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,t,k;
	map <int,int> mp;
	scanf("%d%d",&n,&m);
	for(int i = 1;i <= n;i++){
		scanf("%d",&t);
		mp[t] = i;
	}
	if(mp.size() < m) puts("NO");
	else{
		k = 0,puts("YES");
		for(auto i = mp.begin();i != mp.end();i++){
			if(k) puts(" ");
			printf("%d",i->second);
			if(++k == m) break;
		}
	}
	return 0;
}