1291C - Mind Control - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

void solve(){
	int n, m, k;
	cin>>n>>m>>k;
	k = min(k, m-1);
	int res = 0;
	vector<int> a(n+2), v(m+1);
	for(int i = 1; i <= n; ++i){
		cin>>a[i];
	}
	
	for(int i = 1; i <= m; ++i){
		v[i] = max(a[i], a[n - m + i]);
		//cout<<v[i]<<' ';
		//cout<<i<<' '<<n - m + i<<endl;
	}
	
	//cout<<endl;

	vector<vector<int> > b(m+1, vector<int>(m+1));
	for(int i = 1; i <= m; ++i){
		int cur_min = INT_MAX;
		for(int j = i; j <= m; ++j){
			cur_min = min(cur_min, v[j]);
			b[i][j] = cur_min;
			//cout<<cur_min<<' ';
		}
		//cout<<endl;
	}
	
	for(int i = 0; i <= k+1; ++i){
		for(int j = 1; j <= i; ++j){
			res = max(res, b[j][m - i + j]);
			//cout<<j<<' '<<m-i +j<<endl;
		}
		//cout<<endl;
	}
	//*/
	cout<<res<<'\n';
	return;
}

int main() {
	int t; cin>>t;
	while(t--)solve();
	return 0;
}