Algorithm

A. Diverse Team
time limit per test
1 second
memory limit per test
256 megabytes
Probllem link- https://codeforces.com/contest/988/problem/A
input
standard input
output
standard output

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≤n1≤�≤�) 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≤1001≤�≤�≤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,�2,…,�� (1≤ai≤1001≤��≤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 11 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 11 to n�.

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.

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int n, k, a[101];
set<int> st;
vector<int> sol;

int main() {
  cin >> n >> k;
  for(int i = 0; i < n; ++i)
  	cin >> a[i], st.insert(a[i]);

  if(st.size() < k>
  	cout << "NO" << endl;
  else {
  	for(set<int>::iterator it = st.begin(); it != st.end(); ++it)
  		for(int i = 0; i < n; ++i)
  			if(a[i] == *it) {
  				sol.push_back(i + 1);
  				break;
  			}
  	cout << "YES" << endl;
  	for(int i = 0; i < k; ++i>
  		cout << sol[i] << ' ';
  	cout << endl;
  }

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
5 3
15 13 15 15 12

Output

x
–
+
cmd
YES
1 2 5
Advertisements

Demonstration

Codeforces Solution-A. Diverse Team-Solution in C, C++, Java, Python,Diverse Team,Codeforces Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+