988A. Diverse Team C++

题目地址：http://codeforces.com/problemset/problem/988/A

题目：

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.

Input

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.

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

Examples

input

Copy

5 3
15 13 15 15 12

output

Copy

YES
1 2 5 

input

Copy

5 4
15 13 15 15 12

output

Copy

NO

input

Copy

4 4
20 10 40 30

output

Copy

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.

思路：

这题的意思就是给你N个学生，你去找有没有k种不同的分数，如果有就输出，没有就no。

代码：

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
int main()
{
    int n,k;
    while(cin>>n>>k)
    {
        queue<int> q;
        int b[105];
        int sc;
        int tot=0;
        memset(b,0,sizeof(b));
        int i;
        for(i=0;i<n;i++)
        {
            cin>>sc;
            if(b[sc]==0){tot++;q.push(i+1);}
            b[sc]=1;
        }
        if(tot<k)cout<<"NO"<<endl;
        else
        {
            cout<<"YES"<<endl;
            while(k--)
            {
                cout<<q.front()<<" ";
                q.pop();
            }
            cout<<endl;
        }
    }
    return 0;
}