/*
 * Solution Template for Melody
 * 
 * Australian Informatics Olympiad 2021
 * 
 * This file is provided to assist with reading and writing of the input
 * files for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <cstdio>

/* N is the number of notes. */
int N;

/* K is the largest number which could be a note. */
int K;

/* S contains the sequence of notes forming the song. */
int S[100005];

int answer;

int main(void) {
    /* Open the input and output files. */
    FILE *input_file = fopen("melodyin.txt", "r");
    FILE *output_file = fopen("melodyout.txt", "w");

    /* Read the value of N and K. */
    fscanf(input_file, "%d%d", &N, &K);

    /* Read each note in the song. */
    for (int i = 0; i < N; i++) {
        fscanf(input_file, "%d", &S[i]);
    }

    /*
     * TODO: This is where you should compute your solution. Store the smallest
     * possible number of notes Melody can change so that her song is nice into
     * the variable answer.
     */

    /* Write the answer to the output file. */
    fprintf(output_file, "%d\n", answer);

    /* Finally, close the input/output files. */
    fclose(input_file);
    fclose(output_file);

    return 0;
}