There are nn students in a school class, the rating of the ii-th student on Codehorses is aiai. You have to form a team consisting of kk students (1≤k≤n1≤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 kk 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 nn and kk (1≤k≤n≤1001≤k≤n≤100) — the number of students and the size of the team you have to form.
The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1001≤ai≤100), where aiai is the rating of ii-th student.
If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print kk distinct integers from 11 to nnwhich 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 11 to nn.
5 3 15 13 15 15 12
YES 1 2 5
5 4 15 13 15 15 12
NO
4 4 20 10 40 30
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.
题意:找出不同数字的个数,看与是否大于等于k
题解:每出现一个新数,num++并存在一个数组里,最后判断一下就好了
代码:
#include <bits/stdc++.h>
using namespace std;
int a[110];
int ans[110];
int b[110];
int n, k;
int main()
{
cin>>n>>k;
int num =0;
memset(a,0,sizeof(a));
for(int i=0;i<n;i++)
{
int t;
cin>>t;
if(a[t]==0)
{
b[num++] = i+1;
a[t] = 1;
}
}
if(num>=k)
{
cout<<"YES"<<endl;
for(int i=0;i<k;i++)
{
cout<<b[i]<<" ";
}
}
else
cout<<"NO"<<endl;
}