-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1714A. Everyone Loves to Sleep.cpp
66 lines (50 loc) · 1.09 KB
/
1714A. Everyone Loves to Sleep.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using str = string;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define mp make_pair
#define f first
#define s second
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<str>;
using vc = vector<char>;
#define sz(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define eb emplace_back
const int mod = 998244353; // 1e9+7;
void solve() {
int n, h, m;
cin >> n >> h >> m;
int time_s = 60 * h + m;
int ans = 24 * 60;
for (int i = 0; i < n; i++) {
cin >> h >> m;
int time_w = 60 * h + m - time_s;
if (time_w < 0) time_w += 24 * 60;
ans = min(ans, time_w);
}
cout << ans / 60 << ' ' << ans % 60 << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tc = 1;
cin >> tc;
while (tc--) solve();
return 0;
}