Codeforces Round #486 (Div. 3) A. Diverse Team
Posted edgsheryl
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Codeforces Round #486 (Div. 3) A. Diverse Team相关的知识,希望对你有一定的参考价值。
Codeforces Round #486 (Div. 3) A. Diverse Team
题目连接:
http://codeforces.com/contest/988/problem/A
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 (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 (1≤ai≤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 students are numbered from 1 to n.
Sample Input
5 3
15 13 15 15 12
Sample Output
YES
1 2 5
Hint
Note
All possible answers for the first example:
{1 2 5}
{2 3 5}
{2 4 5}
Note that the order does not matter.
题意
给你一个集合,问你有没有k元子集
题解:
用一个 set 来判重。
代码
#include <bits/stdc++.h>
using namespace std;
int n, k;
int cnt, x;
set<int> s;
queue<int> q;
int main() {
cin >> n >> k;
while (!q.empty()) q.pop();
for (int i = 0; i < n && cnt < k; i++) {
cin >> x;
if (!s.count(x)) {
cnt++;
s.insert(x);
q.push(i + 1);
}
}
if (cnt >= k) {
cout << "YES" << endl;
while (!q.empty()) {
cout << q.front() << " ";
q.pop();
}
} else
puts("NO");
}
以上是关于Codeforces Round #486 (Div. 3) A. Diverse Team的主要内容,如果未能解决你的问题,请参考以下文章
Codeforces Round #486 (Div. 3)完结
Codeforces Round #486 (Div. 3) A. Diverse Team
Codeforces Round #486 (Div. 3) C. Equal Sums
Codeforces Round #486 (Div. 3) F. Rain and Umbrellas