Source Code
#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
bool visa[(int)1e6] ;
int dp[1000000];
int n , k;

int main(){
   ios_base::sync_with_stdio(0);cin.tie(0);
    	
    	cin >> n >> k;
    	vi x(n);
    	ll mx = 0 , s = 0 ;
    	for (auto&i:x){
    		cin>>i;
    		s += i ;
    	}
    	for ( int i = 0 ; i < n ; i++ ) {
    		ll sum = 0 ;
    		for ( int j = i ; j < n ; j += k ) sum += x[j] ;
    		mx = max(mx,sum);
    	}
    	cout << s-mx ;
   return 0;
}
Copy
Offer SAAD
GNU G++17
2 ms
376 KB
Accepted