CodeForce988A - Diverse Team(更是可惜）

A. Diverse Team

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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.

Output

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 nn 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 11 to nn.

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.

代码如下

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,k,a[106],b[1000000],c[106],mark[106];
int main()
{
    cin>>n>>k;
    ll s=0;
    for(ll i=1;i<=n;i++)
    {
      cin>>a[i];
      b[a[i]]++;//记录每一个a[i]出现的次数
      //c[i]=i;
    }
    for(ll i=1;i<=200;i++)
    {
        if(b[i]>=1)++s;//思想是看不同个数的数有多少个
    }
    if(s<k){
            cout<<"NO";
    return 0;
    }
    if(k==1)//上述解法要判断k=1的时候
    {
        cout<<"YES"<<endl<<"1";
        return 0;
    }
    int d=0,p=0;
    for(ll i=1;i<=n;i++)
    {
        for(ll j=1;j<=n;j++)
        {

            if(a[i]!=a[j]&&!mark[a[i]])
                {
                    c[++d]=i;
                    mark[a[i]]=1;
                    break;
                }
                if(d==k){
                        p=1;break;
                }

        }
        if(p==1)break;
    }
    cout<<"YES"<<endl;
    for(ll i=1;i<=k;i++)
        cout<<c[i]<<" ";
}

这道题没A就归功于优秀的服务器，在最后几分钟改出来错误却交不上！

在CF上交就过了！

生气！