Tikut

input/code.cpp: In function 'void p3_sol()':
input/code.cpp:112:62: error: expected ';' before '}' token
  112 |         best_sol_p1 = min(best_sol_p1, max_stick - min_stick)
      |                                                              ^
      |                                                              ;
  113 |     }
      |     ~

#include <iostream>
#include <stdlib.h>
#include <algorithm>    // std::sort

unsigned int n, m;

unsigned int *stick_lengths;


inline unsigned int min(unsigned int a, unsigned int b) {
    return (a < b ? a : b);
}

inline unsigned int max(unsigned int a, unsigned int b) {
    return (a > b ? a : b);
}

void n_is_one_sol() {
    for (unsigned int k = 1; k <= m; k++) {
        if (stick_lengths[0] % k == 0) {
            std::cout << "0 ";
        } else {
            std::cout << "1 ";
        }
    }
}

void p1_sol() {
    /* Osatehtävä 1 (7 pistettä)

        1 <= n <= 5
        1 <= m <= 10
        1 <= a_i <= 10 */
    // brute force? numbers are really small
    throw;
    for (unsigned int k = 1; k <= m; k++) {
        
    }
}

// WORKS
void p2_sol() {
    /* Osatehtävä 2 (8 pistettä)

        1 <= n <= 1000
        1 <= m <= 2000
        1 <= a_i <= 3  */
    unsigned int one_count = 0;
    unsigned int two_count = 0;
    unsigned int three_count = 0;

    unsigned int *solutions = (unsigned int*) malloc(m * sizeof(unsigned int));

    for (unsigned int i = 0; i < n; i++ ) {
        switch (stick_lengths[i]) {
            case 1:
                one_count++;
                break;
            case 2:
                two_count++;
                break;
            case 3:
                three_count++;
                break;
        }
    }

    unsigned int cuts_left = m;
    unsigned int i = 0;
    while (three_count > 0 && cuts_left > 0) {
        three_count--;
        one_count++;
        two_count++;
        if (three_count > 0) {
            solutions[i] = 2;
        } else {
            solutions[i] = 1;
        }
        cuts_left--;
        i++;
    }
    while (two_count > 0 && cuts_left > 0) {
        two_count--;
        one_count += 2;
        if (two_count > 0) {
            solutions[i] = 1;
        } else {
            solutions[i] = 0;
        }
        cuts_left--;
        i++;
    }

    std::cout << solutions[0];
    for (unsigned int j = 1; j < m; j++) {
        std::cout << ' ' << solutions[j];
    }
}

void p3_sol() {
    /* Osatehtävä 3 (12 pistettä)

        1 <= n <= 1000
        1 <= m <= 2
        1 <= a_i <= 1000 */
    unsigned int max_stick = stick_lengths[n-1];
    unsigned int best_sol_p1 = -1;
    for (unsigned int new_stick1_size = 1; new_stick1_size < max_stick; new_stick1_size++) {
        unsigned int new_stick2_size = max_stick - new_stick1_size;
        unsigned int min_stick = min(new_stick1_size, min(new_stick2_size, stick_lengths[0]));
        unsigned int max_stick = max(new_stick1_size, max(new_stick2_size, stick_lengths[n-2]));
        best_sol_p1 = min(best_sol_p1, max_stick - min_stick)
    }
    std::cout << best_sol_p1;
    
    if (m == 2) {
        // i don't care if the code is a little slow
        // nums are so small anyway...
        
    }
}

int main() {
    std::cin >> n >> m;
    stick_lengths = (unsigned int*) malloc((n + m) *sizeof(unsigned int));
    for (unsigned int i = 0; i < n; i++) {
        std::cin >> stick_lengths[i];
    }
    std::sort(stick_lengths, &stick_lengths[n]);
    /*for (int i = 0; i < n; i++) {
        std::cout << stick_lengths[i] << ' ';
    }*/
    
    if (n == 1) {
        n_is_one_sol();
    } else if (m <= 2 && n <= 1000 && stick_lengths[n-1] <= 1000) {
        p3_sol();
    } else if (n <= 5 && m < 10 && stick_lengths[n-1] <= 10) {
        p1_sol();
    } else {
        // p4, p5, p6 don't get points anyway :)
        p2_sol();
    }
    std::cout << std::endl;

    return 0;
}