We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Sets
  4. Set .discard(), .remove() & .pop()
  5. Discussions

Set .discard(), .remove() & .pop()

  • xackxr
     + 0 comments

    **Why this works? .pop() removes an element randomly. But hackrrank assumes always min element is removed. **

    n = int(input())
s = set(map(int, input().split()))
N = int(input())

for _ in range(N):
    cmd = input().split()
    if cmd[0] == 'pop':
        # remove the smallest item to match HackerRank's pop behavior
        s.remove(min(s))
    elif cmd[0] == 'remove':
        s.remove(int(cmd[1]))
    elif cmd[0] == 'discard':
        s.discard(int(cmd[1]))

print(sum(s))