Women in Tech ✅

Get em all ✅

IBM✅

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int minOperations(int k, vector<int>& locks) {
    int n = locks.size();
    int answer = 1e9;
    for (int target = 1; target <= k; ++target) {
        int operations = 0;

        for (int j = 0; j < n; ++j) {
            if (locks[j] == target) continue;
            int direct_op = abs(target - locks[j]);
            int threshold_op = k - locks[j] + target;

            operations += min(direct_op, threshold_op);
        }

        answer = min(answer, operations);
    }

    return answer;
}

int main() {
    int k, n;
    cin >> k >> n;
   
    vector<int> locks(n);
    for (int i = 0; i < n; ++i) {
        cin >> locks[i];
    }

    cout << minOperations(k, locks) << endl;

    return 0;
}