[백준] #1931 Greedy Algorithm python
2022. 12. 5. 13:34
https://www.acmicpc.net/problem/1931
Greedy Algorithm
def count_meeting(meeting_list):
prev_end = 0
count = 0
for begin, end in meeting_list:
if begin >= prev_end:
prev_end = end
count += 1
return count
def main():
n = int(input())
meeting = []
for i in range(n):
begin, end = map(int, input().split())
meeting.append((begin, end))
meeting.sort(key=lambda x: (x[1], x[0]))
print(count_meeting(meeting))
if __name__ == '__main__':
main()
'Programming > Algorithm' 카테고리의 다른 글
Greedy Algorithm python (0) | 2022.12.05 |
---|---|
[백준] #1541 Greedy Algorithm python (0) | 2022.12.05 |
[백준] #5585 Greedy Algorithm python (0) | 2022.12.05 |
[백준] #11722번 Dynamic Programming python (0) | 2022.11.29 |
[백준] #15988번 Dynamic Programming python (0) | 2022.11.28 |