1
2
3
4
5
6
7
8
9
10
|
n,m=map(int,input().split())
cnt=0
least=[]
for _ in range (m):
ai,bi=map(int, input().split())
if ai>=n: cnt+=1
else: least.append( (n-ai));
least=sorted(least)
if cnt >= m-1: print(0)
else: print(sum(least[:m-cnt-1]))
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
[백준] 14581 (0) | 2021.01.14 |
---|---|
[백준] 14487 (0) | 2021.01.14 |
[백준] 14219 (0) | 2021.01.14 |
[백준] 13458 (0) | 2021.01.14 |
[백준] 13420 (0) | 2021.01.14 |
댓글