[프로그래머스] 수열과 구간 쿼리 2

 

 

• 풀이

#include <string>
#include <vector>

using namespace std;

vector<int> solution(vector<int> arr, vector<vector<int>> queries) {
    vector<int> answer;
    for(int i=0; i<queries.size(); i++){
        int min=1000001;
        for(int j=queries[i][0]; j <= queries[i][1]; j++){
            
            if(arr[j]>queries[i][2]&&min>arr[j]) min = arr[j];
        }
        if(min==1000001)answer.push_back(-1);
        else answer.push_back(min);
    }
    return answer;
}