网易2019实习生招聘笔试-牛牛的闹钟

水题，直接贴代码

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace  std;
int n,x;
int p,q;
struct node{
    int h,m;
}ring[101];
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>ring[i].h>>ring[i].m;
        ring[i].m = ring[i].h*60+ring[i].m;
    }
    cin>>x;
    cin>>p>>q;
    q = p*60+q;
    int ans=0;
    for(int i=0;i<n;i++){
        if(ring[i].m+x<=q){
            ans=max(ring[i].m,ans);
        }
    }
    printf("%d %d\n",ans/60,ans%60);
    return 0;
}