← Back to List

34009번: Bob부 멍충이 ↗

Solutions

Python 3
1.0 KB | 1055 chars
"""
[34009: Bob부 멍충이](https://www.acmicpc.net/problem/34009)

Tier: Bronze 2 
Category: ad_hoc
"""


import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
  sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda : [*map(int,inp().split())]
mfi = lambda : [*map(float,inp().split())]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)


def solve():
  n = ii()
  l = mii()
  
  if n % 2:
    print("Bob")
    return 
  
  l.sort()
  
  alice = 0
  bob = 0
  i = 0
  j = n - 1
  while i < j:
    alice += l[j]
    bob += l[i]

    if alice <= bob:
      print("Bob")
      return
    i += 1
    j -= 1

  print("Alice")

if __name__ == "__main__":
  tc = 1
  for t in range(1, tc+1):
    ret = solve()