Dynamic Range Minimum Queries

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

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

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: TIME LIMIT EXCEEDED