import java.util.Scanner; import java.util.function.Consumer; public class Solution { static int n,k; static Long[] cost; static Long[][] mem; public static void main(String[] args) { n = getInt(); k = getInt(); cost = getArrayLong(n); long ans = Integer.MAX_VALUE; for(int i=0; i<2*k+1; i++){ long curr = 0; int j = i; for(;j c){ for(int i=0; i void forn(T[] arr, Consumer c){ for(int i=0; i, S extends Comparable> implements Comparable>{ T first; S second; public Pair(T first, S second){ this.first = first; this.second = second; } @Override public int compareTo(Pair other) { int cmp = first.compareTo(other.first); if(cmp==0) return second.compareTo(other.second); return cmp; } @Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((first == null) ? 0 : first.hashCode()); result = prime * result + ((second == null) ? 0 : second.hashCode()); return result; } @Override public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (getClass() != obj.getClass()) return false; Pair other = (Pair) obj; if (first == null) { if (other.first != null) return false; } else if (!first.equals(other.first)) return false; if (second == null) { if (other.second != null) return false; } else if (!second.equals(other.second)) return false; return true; } } }