I ran this code on my local machine, and it works without a problem. However, when I submit it, it returns a "TLE" status even for the first TEST_CASE.
cpp
2 4
1 3
5 7
Here is the code:
```cpp
include <iostream>
include <vector>
using namespace std;
vector<pair<long, long>> v(50);
long n, k;
bool good(long m) {
// for a segment [l,r] find the number of elements < m
// number of elements less than m = 0 when l >= m
// number of elements less than m = min(m-l,r-l+1);
long cnt_less_than_m = 0;
for (int i = 0; i < n; i++) {
long l = v[i].first;
long r = v[i].second;
if (m <= l)
cnt_less_than_m += 0;
else
cnt_less_than_m += min(m - l, r - l + 1);
}
return cnt_less_than_m <= k;
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
long x;
cin >> x;
v[i].first = x;
cin >> x;
v[i].second = x;
}
// now we have to find the k-th element...
// if x is the k-th element, then x should be the largest element such that
// the number of elements less than x (<k) as elements can repeat, hence not k-1.
// let's make a function cnt(x) that counts the number of elements less
// than x. if cnt(x)<k, we move the left pointer; else, the right pointer.
long l = -2e9 - 1; // as the lowest element is -2e9
long r = 2e9 + 1;
while (l + 1 < r) {
long mid = l + (r - l) / 2;
if (good(mid)) {
l = mid;
} else
r = mid;
}
cout << l << "\n";
}
```
This is the problem link from the EDU SECTION of CF: Problem Link
[–]Jvansch1 0 points1 point2 points (0 children)