Service Lane - HackerRank || HackerRank Service Lane Solution

#include <stdio.h>

int main()
{
    int m, n, i;
    scanf("%d %d", &m, &n);
    int width[m];
    for (i = 0; i < m; i++) scanf("%d", &width[i]);
    for (i = 0; i < n; i++)
    {
        int start, end;
        scanf("%d %d", &start, &end);
        int minimum = width[start];
        for (int j = start; j <= end; j++)
        {
            if (width[j] < minimum) minimum = width[j];
        }
        printf("%d\n", minimum);
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int m, n, i;
    cin >> m >> n;
    int width[m];
    for (i = 0; i < m; i++) cin >> width[i];
    for (i = 0; i < n; i++)
    {
        int start, end;
        cin >> start >> end;
        int minimum = width[start];
        for (int j = start; j <= end; j++)
        {
            if (width[j] < minimum) minimum = width[j];
        }
        cout << minimum << endl;
    }
    return 0;
}

import java.util.Scanner;

public class Service_Lane {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int m = input.nextInt();
        int n = input.nextInt();
        int[] width = new int[m];
        for (int i = 0; i < m; i++) width[i] = input.nextInt();
        for (int i = 0; i < n; i++) {
            int start = input.nextInt();
            int end = input.nextInt();
            int minimum = width[start];
            for (int j = start; j <= end; j++) {
                if (width[j] < minimum) minimum = width[j];
            }
            System.out.println(minimum);
        }
    }
}