class Solution:
def median(self, n , k, arr) -> int:
arr = arr[::-1]
ans = 0
start = n//2
val = start + 1
jump = 1
while jump <= k:
ans+= arr[start]
jump +=1
start = (start) +val
return ans
t = int(input())
for _ in range(t):
n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
obj = Solution()
print(obj.median(n, k, arr))#define _GLIBCXX_FILESYSTEM
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n , t , k , maximum , counter = 0 , input , reach;
long long sum = 0;
cin >> t;
vector < int > inputs;
while ( t-- ){
cin >> n >> k ;
sum = 0 , counter = 0;
reach = ceil( n / 2.0 );
for ( int i = 0 ; i < n*k ; i++ ){
cin >> input;
inputs.push_back(input);
}
for ( int i = n * k - 1 , j = n ; i >= 0 ; i-- ){
if ( j == reach ){
sum+= inputs[i];
j = n;
counter++;
}
else
j--;
if ( counter == k )
break;
}
cout << sum << endl;
inputs.clear();
}
}
1213A - Chips Moving | 490A - Team Olympiad |
233A - Perfect Permutation | 1360A - Minimal Square |
467A - George and Accommodation | 893C - Rumor |
227B - Effective Approach | 1534B - Histogram Ugliness |
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |
1450A - Avoid Trygub | 327A - Flipping Game |
411A - Password Check | 1520C - Not Adjacent Matrix |
1538B - Friends and Candies | 580A - Kefa and First Steps |