Codeforces1175C. Electrification（思维）

https://codeforces.com/contest/1175/problem/C

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;	//1e9
typedef pair<ll,ll> pll;
const int maxn=4e5+5;
const int INF=0x3f3f3f3f;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define forn(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int t,n,k;
int a[maxn];
int main()
{
	cin>>t;
	while(t--){
		cin>>n>>k;
		rep(i,1,n){
			cin>>a[i];
		}
		int maxx=INF,ans=0;
		sort(a+1,a+n+1);	//更均匀  第k+1小 找k+1个数 滑窗 
		rep(i,k+1,n){
			if(a[i]-a[i-k]<maxx){	//方差越小 求出均值 第k+1距离越小 
				maxx=a[i]-a[i-k];
				ans=(a[i]+a[i-k])/2;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}