codeforces 1175C

原题：
C. Electrification
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
At first, there was a legend related to the name of the problem, but now it’s just a formal statement.

You are given n points a1,a2,…,an on the OX axis. Now you are asked to find such an integer point x on OX axis that fk(x) is minimal possible.

The function fk(x) can be described in the following way:

form a list of distances d1,d2,…,dn where di=|ai−x| (distance between ai and x);
sort list d in non-descending order;
take dk+1 as a result.
If there are multiple optimal answers you can print any of them.

Input
The first line contains single integer T (1≤T≤2⋅105) — number of queries. Next 2⋅T lines contain descriptions of queries. All queries are independent.

The first line of each query contains two integers n, k (1≤n≤2⋅105, 0≤k<n) — the number of points and constant k.

The second line contains n integers a1,a2,…,an (1≤a1<a2<⋯<an≤109) — points in ascending order.

It’s guaranteed that ∑n doesn’t exceed 2⋅105.

Output
Print T integers — corresponding points x which have minimal possible value of fk(x). If there are multiple answers you can print any of them.

Example
inputCopy
3
3 2
1 2 5
2 1
1 1000000000
1 0
4
outputCopy
3
500000000
4
题意：
给一个长度为n的数组，找出一个数x，让数组中每一个数减去x取绝对值，然后排序，使得第k+1个数最小.
思路：
先sort一遍数组，找到数组中方差最小的k+1个数，则这k+1个数的最大值和最小值的平均值为x，就会使得这k+1个数的与x的距离最小，也就保证了第k+1个数最小
AC代码

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int Maxn=2e5+7;
const ll Maxll=1e18+7;

int t;
int n,k;
int aa[Maxn];
ll ans;
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&k);
        for(int i=1;i<=n;i++)
            scanf("%d",&aa[i]);
        sort(aa+1,aa+1+n);
        ll Minsum=Maxll;
        int dot;
        for(int i=1;i<=n-k;i++)
        {
            ll dec=aa[i+k]-aa[i];
            if(dec<Minsum)
            {
                Minsum=dec;
                dot=i;
            }
        }
        ans=(aa[dot]+aa[dot+k])/2;
        printf("%lld\n",ans);
    }
	return 0;
}