#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc,char* argv[]) {
int n;
int mins;
int h,m;
scanf("%d", &n);
vector<int> times;
times.clear();
for (int i = 0; i < n; ++i) {
scanf("%d%d",&h,&m);
times.push_back(h * 60 + m);
}
scanf("%d", &mins);
scanf("%d%d",&h,&m);
/* 计算最近时间 */
int nTime = 60 * h + m;
nTime -= mins;
if(nTime < 0) nTime += 24 * 60;
int minValue = 0x3f3f3f3f;
int mflag = 0;
for(int i = 0; i < times.size(); ++i) {
if(abs(times[i] - nTime) < minValue) {
minValue = abs(times[i] - nTime);
mflag = i;
}
}
printf("%d %d\n",times[mflag]/60, times[mflag]%60);
return 0;
}
第一题算分钟就行了