Dynamic Range Minimum Queries

#include "iostream"
#include "cmath"
#include "climits"
#include "algorithm"

int main() {
    int n, q;
    std::cin >> n >> q;
    int m = std::sqrt(n);
    int array[n], mins[m + 1];
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            std::cin >> array[i * m + j];
        }
        mins[i] = *std::min_element(array + i * m, array + (i + 1) * m);
    }
    int rest = n - m * m;
    for (int i = 0; i < rest; i++) {
        std::cin >> array[m * m + i];
    }
    if (rest) mins[m] = *std::min_element(array + m * m, array + n);
    int queries[3];
    for (int i = 0; i < q; i++) {
        std::cin >> queries[0] >> queries[1] >> queries[2];
        int idx = (queries[1] - 1) / m;
        if (queries[0] == 1) {
            array[queries[1] - 1] = queries[2];
            mins[idx] = *std::min_element(array + idx * m, array + (idx + 1) * m);
        } else {
            std::cout << mins[idx] << std::endl;
        }
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER