//%一发大佬的代码,是真的漂亮
#include<bits/stdc++.h>
using namespace std;
int n,k,i,x;
map<int,int> p;
int main(){
for(cin>>n>>k,i=1;i<=n;i++)cin>>x,p[x]=i;
if(p.size()<k)return cout<<"NO",0;
cout<<"YES"<<endl;
i=0;
for(auto s:p)if(i++<k)cout<<s.second<<" ";
}
There are 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
) — 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.
If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print k
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.
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