zoukankan      html  css  js  c++  java
  • A

    Problem description

    There are n students in a school class, the rating of the i-th student on Codehorses is ai. You have to form a team consisting of k students (1kn) 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 (1kn100) — the number of students and the size of the team you have to form.The second line contains n integers a1,a2,,an (1ai100), 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 students are numbered from 1 to n.

    Examples

    Input

    5 3
    15 13 15 15 12

    Output

    YES
    1 2 5

    Input

    5 4
    15 13 15 15 12

    Output

    NO

    Input

    4 4
    20 10 40 30

    Output

    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个不同的数字,如果有输出"YES",并且依次输出他们的序号,否则输出"NO",简单水过!

    AC代码:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4     int n,k,x,m=0,a[105],b[105];bool flag;//a数组存放不重复的元素,b数组记录每个元素的位置
     5     cin>>n>>k;
     6     for(int i=1;i<=n;++i){
     7         cin>>x;flag=false;
     8         for(int j=0;j<m;++j)
     9             if(a[j]==x){flag=true;break;}
    10         if(!flag){b[m]=i;a[m++]=x;}
    11     }
    12     if(m>=k){
    13         cout<<"YES"<<endl;
    14         for(int i=0;i<k;++i)
    15             cout<<b[i]<<(i==k-1?"
    ":" ");
    16     }
    17     else cout<<"NO"<<endl;
    18     return 0;
    19 }
  • 相关阅读:
    性能测试系列(1)-性能测试基本概念
    性能篇综合汇总
    【CTFHUB】Web技能树
    Flash XSS
    绕过CDN找到⽬标站点真实IP
    【网鼎杯2020白虎组】Web WriteUp [picdown]
    【网鼎杯2020朱雀组】Web WriteUp
    【网鼎杯2020青龙组】Web WriteUp
    利用DNSLog实现无回显注入
    Cobalt Stike使用教程
  • 原文地址:https://www.cnblogs.com/acgoto/p/9124992.html
Copyright © 2011-2022 走看看