백준 3985 롤 케이크

https://www.acmicpc.net/problem/3985

3985번: 롤 케이크

 

l=int(input())+1
nums=[0]*l
n=int(input())
expected_value=0
expected_index=0
for i in range(n):
    p, k = map(int,input().split())
 
    if (k-p) > expected_value:
        expected_index=i+1
        expected_value=k-p
 
    for j in range(p,k+1):
        if nums[j]== 0:
            nums[j]=i+1
counting_sort=[0]*(n+1)
for i in nums:
    if i==0:
        pass
    else:
        counting_sort[i]+=1
 
print(expected_index)
print(counting_sort.index(max(counting_sort)))

첫번째 For 문은 가장 많이 받을거라 기대되는 방청객 구하는 구문이고
두번째 For 문이 계수정렬을 통해 실제로 가장 많이 받게 되는 방청객 구문입니당

First For loop is to find audience who is expected to get most pieces of cake.
Second For loop is to find audience who really will get most pieces of cake, using counting-sort