) 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.
InputThe 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.
OutputIf it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print k
distinct integers from 1 to nwhich 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.
Examples5 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.
AC代码:(实质上就是找数值不同的数字个数以及他们的位置)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[120],b[120], i, h, n, k, x;
while(scanf("%d %d",&n, &k)!=EOF)
{
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
h = 0;
for(i = 0;i<n;i++)
{
scanf("%d",&x);
if(b[x]==0)
{
a[h++] = i+1;
b[x]++;
}
else
b[x]++;
}
if(h>=k)
{
printf("YES\n");
for(i = 0;i<k;i++)
printf("%d%c",a[i],i==k-1?'\n':' ');
}
else
printf("NO\n");
}
return 0;
}