-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1980B.cpp
More file actions
79 lines (63 loc) · 1.52 KB
/
1980B.cpp
File metadata and controls
79 lines (63 loc) · 1.52 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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
//============================================================================
// Name : 1980B.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<climits>
#include<cstdint>
using namespace std;
#define ll long long int
#define test int t; cin>>t; while(t--)
#define input(a) int e; for(int i=0; i<n; i++) cin>>e, a.push_back(e)
#define output(a) for(auto p:a) cout<<p<<" "
#define el cout<<endl
ll power(ll x, ll y) {
if (y == 0)
return 1;
return x * power(x, y - 1);
}
void solve() {
int n, f, k, e;
cin >> n >> f >> k;
vector<int> cubes;
for (int i = 0; i < n; i++) {
cin >> e;
cubes.push_back(e);
}
int fav_cube = cubes[f - 1];
sort(cubes.rbegin(), cubes.rend());
int count_fav_cube = count(cubes.begin(), cubes.begin() + k, fav_cube);
int count_total_fav_cube = count(cubes.begin(), cubes.end(), fav_cube);
string res = (count_fav_cube == count_total_fav_cube) ? "YES" :
(count_fav_cube == 0) ? "NO" : "MAYBE";
cout << res;
el;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
solve();
}
}