Submission #975626

#TimeUsernameProblemLanguageResultExecution timeMemory
975626vjudge1Watching (JOI13_watching)C++17
0 / 100
1035 ms344 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define v(a) vector<a> v(ll) arr; ll n, p, q; ll binsearch(ll l, ll r, ll c1){ if(l <= r){ ll mid = (l+r)/2; ll cur = 2*mid*c1; bool ok = false; ll pos = upper_bound(arr.begin(), arr.end(), cur)-arr.begin()-1; // cout << pos << " " << mid << '\n'; if(n-pos-1 <= p) ok = true; if(ok) return min(mid, binsearch(l, mid-1, c1)); return binsearch(mid+1, r, c1); } } int main(){ cin >> n >> p >> q; arr.resize(n); for(int i = 0; i < n; i++) cin >> arr[i]; sort(arr.begin(), arr.end()); if(p >= n || q >= n) cout << 1; else { cout << binsearch(1, 1e9, q); } }

Compilation message (stderr)

watching.cpp: In function 'long long int binsearch(long long int, long long int, long long int)':
watching.cpp:21:1: warning: control reaches end of non-void function [-Wreturn-type]
   21 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...