結果

問題 No.1570 Blocks
ユーザー KeroruKeroru
提出日時 2021-06-27 14:00:47
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 784 ms / 2,000 ms
コード長 3,679 bytes
コンパイル時間 528 ms
コンパイル使用メモリ 87,072 KB
実行使用メモリ 108,052 KB
最終ジャッジ日時 2023-09-07 17:44:03
合計ジャッジ時間 25,316 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 243 ms
83,608 KB
testcase_01 AC 242 ms
83,260 KB
testcase_02 AC 432 ms
91,352 KB
testcase_03 AC 674 ms
102,004 KB
testcase_04 AC 409 ms
89,380 KB
testcase_05 AC 417 ms
89,628 KB
testcase_06 AC 572 ms
97,788 KB
testcase_07 AC 268 ms
84,468 KB
testcase_08 AC 653 ms
102,628 KB
testcase_09 AC 713 ms
106,424 KB
testcase_10 AC 458 ms
92,340 KB
testcase_11 AC 480 ms
93,768 KB
testcase_12 AC 734 ms
107,500 KB
testcase_13 AC 544 ms
95,268 KB
testcase_14 AC 548 ms
96,172 KB
testcase_15 AC 360 ms
87,684 KB
testcase_16 AC 533 ms
96,084 KB
testcase_17 AC 465 ms
91,588 KB
testcase_18 AC 470 ms
92,216 KB
testcase_19 AC 467 ms
93,084 KB
testcase_20 AC 355 ms
87,536 KB
testcase_21 AC 611 ms
98,924 KB
testcase_22 AC 237 ms
83,472 KB
testcase_23 AC 238 ms
83,484 KB
testcase_24 AC 238 ms
83,284 KB
testcase_25 AC 240 ms
83,276 KB
testcase_26 AC 242 ms
83,268 KB
testcase_27 AC 241 ms
83,160 KB
testcase_28 AC 241 ms
83,168 KB
testcase_29 AC 245 ms
83,440 KB
testcase_30 AC 238 ms
83,432 KB
testcase_31 AC 238 ms
83,260 KB
testcase_32 AC 720 ms
106,928 KB
testcase_33 AC 735 ms
106,692 KB
testcase_34 AC 508 ms
94,412 KB
testcase_35 AC 728 ms
108,048 KB
testcase_36 AC 507 ms
95,252 KB
testcase_37 AC 694 ms
105,172 KB
testcase_38 AC 707 ms
105,888 KB
testcase_39 AC 525 ms
96,296 KB
testcase_40 AC 513 ms
95,512 KB
testcase_41 AC 730 ms
105,988 KB
testcase_42 AC 539 ms
96,084 KB
testcase_43 AC 541 ms
96,248 KB
testcase_44 AC 545 ms
96,076 KB
testcase_45 AC 550 ms
96,384 KB
testcase_46 AC 784 ms
108,052 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()
import bisect,string,math,time,functools,random,fractions
from bisect import*
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def I():return int(input())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def AI():return map(int,open(0).read().split())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def INP():
    N=10
    n=random.randint(1,N)
    a=RLI(n,0,n-1)
    return RI(0,100),RI(1,100),RI(1,100)
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print(inp)
            print('naive',a1)
            print('solve',a2)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:a,b=inp;c=1
        else:a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
#mo=998244353
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
alp=[chr(ord('a')+i)for i in range(26)]
#sys.setrecursionlimit(10**7)
def gcj(c,x):
    print("Case #{0}:".format(c+1),x)

show_flg=False
show_flg=True


ans=0


n=I()
f=[]
q=[]
s=0
for i in range(n):
    a,b=LI()
    s+=a
    f+=(a+b,a,b),
f.sort()

tmp=[]
for i in range(n):
    while f and f[-1][0]>=s:
        _,a,b=f.pop()
        heappush(q,(-a,b))
    if q:
        a,b=heappop(q)
        a=-a
        s-=a
        tmp+=(a,b),
    else:
        exit(print('No'))
print('Yes')
0