-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQ2594.java
More file actions
65 lines (57 loc) · 2.07 KB
/
Q2594.java
File metadata and controls
65 lines (57 loc) · 2.07 KB
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
/**
* Date: 09/11/2018
* Author: inhyuck | https://github.com/inhyuck
* Solution URL: https://github.com/inhyuck/problem-solving
* Title: 놀이공원
* description: 놀이기구 운영 일정이 주어질 때,
* 그 날 세혁이와 근영이가 함께할 수 있는 가장 긴 시간을 구하는 프로그램을 작성하시오.
* Solution Key: -
* Problem URL: https://www.acmicpc.net/problem/2594
*/
package io.inhyuck.basic;
import java.util.Arrays;
import java.util.Scanner;
public class Q2594 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
RunningTime[] runningTimes = new RunningTime[n];
for (int i = 0; i < n; i++) {
runningTimes[i] = new RunningTime(scanner.nextInt(), scanner.nextInt());
}
Arrays.parallelSort(runningTimes, (x, y) -> x.startTime - y.startTime);
int nowTime = 600; // 10:00
int maxTimeSize = 0;
for (RunningTime runningTime : runningTimes) {
if (runningTime.startTime >= 1330) { //22:10
break;
}
if (nowTime < runningTime.startTime - 10) {
maxTimeSize = Math.max(runningTime.startTime - 10 - nowTime, maxTimeSize);
}
if (nowTime <= runningTime.endTime) {
nowTime = runningTime.endTime + 10;
if (nowTime >= 1320) {
break;
}
}
}
maxTimeSize = Math.max(1320 - nowTime, maxTimeSize);
System.out.println(maxTimeSize);
}
static class RunningTime {
int startTime;
int endTime;
public RunningTime(int startTime, int endTime) {
this.startTime = (startTime / 100) * 60 + startTime % 100;
this.endTime = (endTime / 100) * 60 + endTime % 100;
}
@Override
public String toString() {
return "RunningTime{" +
"startTime=" + startTime +
", endTime=" + endTime +
'}';
}
}
}