UVa 11958 - Coming Home

// Uva 11958 - Coming Home

#include <stdio.h>

int main() {
	int cases;
	scanf("%d", &cases);
	for (int cas = 1; cas <= cases; cas++) {
		int n, starth, startm;
		scanf("%d %d:%d", &n, &starth, &startm);
		int start = starth * 60 + startm;
		int earliestTime = -1;
		for (int i = 0; i < n; i++) {
			int tripTime, h, m;
			scanf("%d:%d %d", &h, &m, &tripTime);
			if (h < starth || h == starth && m < startm)
				h += 24;
			tripTime += h * 60 + m;
			if (tripTime < earliestTime || i == 0)
				earliestTime = tripTime;
		}
		printf("Case %d: %d\n", cas, earliestTime - start);

	}
	return 0;
}