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<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<list>
using namespace std;
const double eps = 1e-8;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const LL LL_INF = 0x3f3f3f3f3f3f3f3f;
const LL LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};
const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};
const int MOD = 1e9 + 7;
const double pi = acos(-1.0);
const int MAXN=40010;
const int MAXM=100010;
const int M=110;
int a[M],vis[M],b[M],c[M];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
vis[a[i]]++;
b[a[i]]=i;
}
int sum=0;
for(int i=1;i<=100;i++)
{
if(vis[i]>=1)
{
sum++;
c[sum]=b[i];
if(sum==m) break;
}
}
if(sum==m)
{
cout<<"YES"<<endl;
sort(c+1,c+m+1);
for(int i=1;i<=m;i++)
printf("%d ",c[i]);
cout<<endl;
}
else
{
cout<<"NO"<<endl;
}
return 0;
}
