import os
import sys
import heapq# 请在此输入您的代码if __name__=="__main__":x,n= map(int,input().split())l=[]a=[0]*nb=[0]*nc=[0]*nq=[]for i in range(n):l.append(list( map( int ,input().split()) ))l.sort(key=lambda pair:-pair[1])total=0j=0for i in range(x,0,-1):while j<n and l[j][1]>=i:heapq.heappush(q,l[j])j+=1if not q:print(-1)breakpop = heapq.heappop(q)total+=pop[0]if pop[2]>1:pop[2]-=1heapq.heappush(q,pop)else:print(total)

import os
import sys# 请在此输入您的代码def check(t)->bool:mylist= [] for i in range(n):if t>=s[i]:mylist.append([ l[i]-(t-s[i]) ,l[i]+(t-s[i]) ])if not mylist:return Falsemylist.sort()if mylist[0][0]>1:return Falseright=mylist[0][1]for i in range(1,len(mylist)):if mylist[i][0] <= right + 1:right= max(right,mylist[i][1])else:breakreturn right>=lengthif __name__=="__main__":n,length=map(int,input().split())l=[0]*ns=[0]*nfor i in range(n):l[i],s[i] =  map(int,input().split())left=0r=2_000_000_000while(left<r):mid=(left+r)//2if check(mid):r=midelse:left=mid+1print(r)