https://www.hackerrank.com/challenges/service-lane

servicelane.c

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <assert.h>
#include <ctype.h>
int lane[100010];
int min(int pint, int pont);
int main(int argc, char const *argv[])
{
	int n,testc,i,j;
	scanf("%d%d", &n,&testc);
	for (i = 0; i < n; ++i)
		scanf("%d", &lane[i]);
	while(testc--)
	{
		scanf("%d%d", &i,&j);
		printf("%d\n", min(i,j));
	}
	return 0;
}
int min(int pint, int pont)
{
	int i,mini=lane[pint];
	for (i = pint+1; i <= pont; ++i)
		if (mini>lane[i])
			mini=lane[i];
	return mini;
}