Dynamic Range Minimum Queries

#include <iostream>
#include <vector>
#include <string>
#include <format>


int main (int argc, char **argv) {

    int n, q;
    std::cin >> n >> q;

    std::vector<int> numbers;
    numbers.reserve(n);
    for (int i=0; i<n; i++) {
        int num;
        std::cin >> num;

        numbers.push_back(num);
    }

    //std::cout << std::format("{}", numbers) << std::endl;

    std::string result;
    for (int i=0; i<q; i++) {
        int t, a, b;
        std::cin >> t >> a >> b;
        
        if (t == 1) {
            numbers.at(a-1) = b;
        } else {
            a--;
            b--;
            if (numbers.at(a) < numbers.at(b)) {
                result = result + std::to_string(numbers.at(a)) + '\n';
            } else {
                result = result + std::to_string(numbers.at(b)) + '\n';
            }
        }
    }

    std::cout << result << std::endl;


    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: TIME LIMIT EXCEEDED