CF #486 div3 A. Diverse Team(经典数组操作）

A. Diverse Team

Description:

There are n students in a school class, the ratingof the i-th student on Codehorses is ai. You have to form a team consisting of k students (1≤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 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≤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 a_1,a_2,…,a_na (1≤ai a_ia i ≤100), where ai 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 studesnts are numbered from 1 to n.

Sample Input:

5 3
15 13 15 15 12

Sample Output:

YES
1 2 5

Sample Input:

5 4
15 13 15 15 12

Sample Output:

NO

Sample Input:

4 4
20 10 40 30

Sample Output:

YES
1 2 3 4

题意：找不不同的数标记位置。

#include<bits/stdc++.h>
using namespace std;
const int N = 105;
int vis[N];
int main()
{
    int n,k;
    scanf("%d %d",&n,&k);
    int type=0;
    for(int i=0; i<n; i++)
    {
        int x;
        scanf("%d",&x);
        if(!vis[x])
        {
            vis[x]=i+1;
            type++;
        }
    }
    if(type<k) printf("NO\n");
    else
    {
        printf("YES\n");
        int j=0;
        sort(vis,vis+101);
        for(int i=0; i<=100; i++)
            if(vis[i])
            {
                if(k==1)
                    printf("%d\n",vis[i]);
                else if(k>1)
                    printf("%d ",vis[i]);
                else
                    break;
                k--;
            }
    }
    return 0;
}