网易笔试题——牛牛的闹钟

#include<iostream>
using namespace std;
int main(){
    int N;
    cin>>N;
    int H[100];
    int M[100];
    for(int i=0; i<N; i++){
        cin>>H[i];
        cin>>M[i];
    }
    int X;
    cin>>X;
    int target_H;
    int target_M;
    cin>>target_H;
    cin>>target_M;
    int last_time[100];
    int flag = -1;
    int min = 23*60+59;
    for(int i=0; i<N; i++){
        last_time[i] = (target_H - H[i]) * 60 + (target_M - M[i]);
        if(last_time[i] >= X && min >= last_time[i]){
            min = last_time[i];
            flag = i;
        }
    }
    cout<<H[flag]<<' '<<M[flag]<<endl;
}