HackerRank Truck Tour

题目链接

#include<stdio.h>

int FindMin(int *queue, int n)
{
	long long sum = 0;
	int i = 0, j = 0;
	for (; i < n; i++)
	{
		sum += queue[i];
		if (sum < 0)
		{
			sum = 0;
			j = i + 1;
		}
	}
	return j;
}


int main()
{
	int i, n, num, dis;
	int queue[100001];
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		scanf("%d%d", &num, &dis);
		queue[i] = num - dis;
	}
	printf("%d\n", FindMin(queue, n));
	return 0;
}