easy short efficient clean code
\nclass Solution {\npublic:\ntypedef long long ll;\n#define vi(x) vector<x>\ntypedef pair<ll, ll> pi;\nbool possible(const vi(int)&v, ll in, const ll&k){\n    l
```\nclass Solution {\npublic:\ntypedef long long ll;\n#define vi(x) vector<x>\ntypedef pair<ll, ll> pi;\nbool possible(const vi(int)&v, ll in, const ll&k){\n    ll tot=1;\n    bool take=false;\n    for(ll i=in-1;i>-1;--i){\n        if(!take){\n            take=1;\n            continue;\n        }\n        if(v[i]<=v[in]){\n            tot++;\n            take=0;\n        }\n    }\n    take=false;\n    for(ll i=in+1;i<v.size();++i){\n        if(!take){\n            take=1;\n            continue;\n        }\n        if(v[i]<=v[in]){\n            tot++;\n            take=0;\n        }\n    }\n    return (tot>=k);\n}\n\nint minCapability(vector<int>&v, int k) {\n    ll n=v.size(), ans=-1, l=0, r=n-1;\n    vi(pi)arr(n);\n    for(ll i=0;i<n;++i){\n        arr[i]={v[i], i};\n    }\n    sort(begin(arr), end(arr));\n    while(l<=r){\n        ll m=l+((r-l)>>1);\n        if(possible(v, arr[m].second, k)){\n            ans=arr[m].first, r=m-1;\n        }\n        else{\n            l=m+1;\n        }\n    }\n    return ans;\n}\n};\n```
['C', 'Binary Tree']