forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
38 lines (32 loc) · 1.09 KB
/
B.cpp
File metadata and controls
38 lines (32 loc) · 1.09 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
int n, k, a[1011], b[1011];
int main() {
freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
while (cin >> n >> k) {
FOR(i,1,n) {
cin >> a[i];
b[i] = a[i];
}
sort(b+1, b+n+1, greater<int>());
int bound = b[k];
cout << bound << endl;
FOR(i,1,n) {
if (k == 0) break;
if (a[i] >= bound) {
cout << i << ' ';
--k;
}
}
cout << endl;
}
return 0;
}