https://codeforces.com/problemset/problem/1370/D
思路:
对于答案进行二分。只要奇数和偶数一个满足<=x的check就好。分别计算奇数和偶数制造出<=x的序列长度,如果>=k,说明还能减少
#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar(); while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
bool check(LL mid,LL k,LL n){
LL tot1=0;
for(LL i=1;i<=n;i++){///奇数部分随便取
if(tot1%2==0){
tot1++;
}
else{
if(a[i]<=mid) tot1++;
}
}
LL tot2=0;
for(LL i=1;i<=n;i++){///偶数部分随便取
if(tot2&1){
tot2++;
}
else{
if(a[i]<=mid) tot2++;
}
}
LL len=max(tot1,tot2);
if(len>=k) return true;
else return false;
}
int main(void){
cin.tie(0);std::ios::sync_with_stdio(false);
LL n,k;cin>>n>>k;
for(LL i=1;i<=n;i++) cin>>a[i];
LL l=1;LL r=1e9;
while(l<r){
LL mid=(l+r)>>1;
if(check(mid,k,n)) r=mid;
else l=mid+1;
}
cout<<l<<"\n";
return 0;
}