Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int t,n,k,p,w,b,l,r;
- vector <int> v;
- // map <int,int> m;
- int f(int a) {
- int c;
- for (int i = 0; i < k; i++) {
- if (v[i]<a) {
- c++;
- } else break;
- }
- return a-c;
- }
- int main() {
- cin >> t;
- while(t--) {
- cin >> n >> k >> p;
- v.clear();
- // m.clear();
- for (int i = 0; i < k; i++) {
- cin >> w;
- v.push_back(w);
- }
- sort(v.begin(),v.end());
- l = 0;
- r = k-1;
- while(l!=r) {
- if (f(l+r)<=p) {
- r=(l+r)/2;
- } else {
- l=(l+r)/2;
- }
- }
- cout << l << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement