#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
    int minSideJumps(vector<int>& obstacles) {
        const int inf = 1 << 30;  
        vector<int> f(3, inf);    
        f[1] = 0;               

        for (int i = 0; i < obstacles.size(); ++i) {
            vector<int> new_f(3, inf);  
            for (int j = 0; j < 3; ++j) {
                if (obstacles[i] != j + 1) {
                    new_f[j] = min(f[j], min({f[(j + 1) % 3], f[(j + 2) % 3]}) + 1);
                }
            }
                        f = new_f;
        }
        return min({f[0], f[1], f[2]});
    }
};

#include <bits/stdc++.h>
using namespace std;
long long getMinimumTotalCost(vector<int>& weights, int k) {
    vector<int> adjSums;
    int n = weights.size();
    for (int i = 0; i < n - 1; i++) {
        adjSums.push_back(weights[i] + weights[i + 1]);
    }
    sort(adjSums.begin(), adjSums.end());
    long long minCost = weights[0] + weights[n - 1];
    for (int i = 0; i < k - 1; i++) {
        minCost += adjSums[i];
    }
    return minCost;
}