python-algorithm
[백준] 14471
무적김두칠
2021. 1. 14. 10:24
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 |
반응형