牛牛的闹钟

PYTHON:一次遍历

n  = int(raw_input())
v=[]
for i in range(n):
    line = raw_input()
    v.append(int(line.split(' ')[0])*60 + int(line.split(' ')[1]))
time = int(raw_input())
line = raw_input()
tar = int(line.split(' ')[0])*60 + int(line.split(' ')[1])
ma = v[0]
for i in range(1, n):
    if v[i] >= ma and (tar-v[i]) >= time:
        ma = v[i]
    else:
        continue
print str(ma/60)+' '+str(ma%60)

 

	clock_num =int(input())



	clock_time =[]



	fori inrange(clock_num):



	    hour,minute =list(map(int,input().split()))



	    clock_time.append(hour*60+minute)



	clock_time =sorted(clock_time) #记得排序



	X =int(input())



	time =list(map(int,input().split()))



	Time =time[0]*60+time[1]



	latest_time =Time -X



	 



	fori inrange(clock_num-1,-1,-1):



	    ifclock_time[i] <=latest_time:



	        late =clock_time[i]



	        break    # 非常重要，因为找到第一个就要停下来



	hour =int(late/60)



	minute =late%60



	print(str(hour)+' '+str(minute))

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
        vector<int> co(n);
        int bg,tm;
        for(int i=0;i<n;i++)
        {
            cin>>bg>>tm;
            co[i]=bg*60+tm;
        }
        int inter;
        cin>>inter;
        cin>>bg>>tm;
        int fin=bg*60+tm;
        sort(co.begin(),co.end());
        reverse(co.begin(),co.end());
        for(int i=0;i<n;i++)
        {
            if(co[i]+inter<=fin)
            {
                cout<<co[i]/60<<' '<<co[i]%60<<endl;
                break;
            }
        }

    }
}