P1614 爱与愁的心痛 洛谷 c++实现

//
// Created by Sween'e'y on 2022/8/8.
//
//P1614 爱与愁的心痛

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

template
int length(T &array) {
      return sizeof(array) / sizeof(array[0]);
}

bool is_prime[100007];

void ai() {
      for (int i = 2; i <= 100000; i++) {
            is_prime[i] = 1;
      }
      for (int i = 2; i <= 100000; i++) {
            if (is_prime[i]) {
                  for (int j = 2 * i; j <= 100000; j += i) {
                        is_prime[j] = 0;
                  }
            }
      }
}

int numberInversion(int x) {
      int num = 0;
      while (x != 0) {
            num = num * 10 + x % 10;
            x /= 10;
      }
      return num;
}

int arr[3005];

int main() {
      int n, m, minn = INT_MAX, sum;
      scanf("%d%d", &n, &m);
      for (int i = 0; i < n; i++) {
            scanf("%d", &arr[i]);
      }
      for (int i = 0; i < n - m + 1; i++) {  //连续m个
            sum = arr[i];
            for (int j = i + 1; j < i + m; j++) {  //m-1 个
                  sum += arr[j];
            }
            if (minn > sum) {
                  minn = sum;
            }
      }
      printf("%d", minn);
      return 0;
}