[BAEKJOON] 10868 최소값

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() {     int n, quiz_count;     scanf("%d %d", &n, &quiz_count);     vector<pair<int,int>>num(n+1);     for (int j = 1; j <= n; j++)     {         scanf("%d", &num[j].first);         num[j].second = j;     }     sort(num.begin(), num.end());     int start, end;     for (int j = 0; j < quiz_count; j++)     {         scanf("%d %d", &start, &end);                   for (int j = 0; j < n; j++)         {             if (num[j].second >= start && num[j].second <= end)             {                 printf("%d\n", num[j].first);                 break;             }         }     }     return 0; }

화가 날땐 쉬운 문제를 풀고

맞았습니다!!가 뜨면 행복해진다..

:)