Problem:


Score : 600 points

Problem Statement

There is a function f(x), which is initially a constant function f(x) = 0.

We will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:

An update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).

An evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.

We can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.

Constraints

All values in input are integers.

1 \leq Q \leq 2 \times 10^5

-10^9 \leq a, b \leq 10^9

The first query is an update query.

Input

Input is given from Standard Input in the following format:

Q
Query_1
:
Query_Q

See Sample Input 1 for an example.

Output

For each evaluation query, print a line containing the response, in the order in which the queries are given.

The response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.

Sample Input 1

4
1 4 2
2
1 1 -8
2

Sample Output 1

4 2
1 -3

In the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.

In the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \leq x \leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.

Sample Input 2

4
1 -1000000000 1000000000
1 -1000000000 1000000000
1 -1000000000 1000000000
2

Sample Output 2

-1000000000 3000000000



Sample input:
4
1 4 2
2
1 1 -8
2


Sample output:
4 2
1 -3

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    if a <= 5:
        print(0)
    elif 6 <= a <= 12:
        print(b // 2)
    else:
        print(b)
    return

#B
def B():
    r, d, x = LI()
    for i in range(10):
        print(x * r - d)
        x = x * r - d
    return

#C
def C():
    n, m = LI()
    imo = [0 for i in range(n+1)]
    for _ in range(m):
        l, r = LI_()
        imo[l] += 1
        imo[r + 1] -= 1
    for i in range(1,n):
        imo[i] += imo[i - 1]
    ans = 0
    #print(imo)
    for i in imo:
        if i == m:
            ans += 1
    print(ans)
    return

#D
def D():
    n, m = LI()
    a = LI()
    bc = LIR(m)
    bc.sort(key=lambda x: x[1], reverse=True)
    a.sort()
    index = 0
    suma = 0
    for b, c in bc:
        if index + b >= n:
            if a[n - 1] <= c:
                suma += (n - index) * c
            else: 
                br = bisect_left(a, c)
                if br > index:
                    suma += (br - index) * c
                    index = br
                    break
                else:
                    break
            index = n
            break
        if a[index + b - 1] < c:
            suma += b * c
            index += b
        else:
            if a[index] < c:
                bl = bisect_left(a, c)
                suma += (bl - index) * c
                index = bl
            else:
                break
    suma += sum(a[index:])
    print(suma)

    return

#E
def E():
    n, m, k = LI()
    def cmb(n, r, mod):
        if ( r<0 or r>n ):
            return 0
        r = min(r, n-r)
        return g1[n] * g2[r] * g2[n-r] % mod

    g1 = [1, 1] 
    g2 = [1, 1]
    inverse = [0, 1] 

    for i in range( 2, n*m + 1 ):
        g1.append( ( g1[-1] * i ) % mod )
        inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
        g2.append((g2[-1] * inverse[-1]) % mod)
        
    ans = 0
    for d in range(1,n+1):
        ans += d*cmb(n * m - 2, k - 2, mod) * (n - d) * m ** 2 
    for d in range(1,m+1):
        ans += d*cmb(n * m - 2, k - 2, mod) * (m - d) * n ** 2
    print(ans%mod)
    

    
    return

#F
def F():
    q = II()
    small = []
    big = []
    len_small = 0
    len_big = 0
    ans = 0
    ds = defaultdict(int)
    db = defaultdict(int)
    for i in range(q):
        query = LI()

        if query[0] == 1:
            a, b = query[1:3]
            ans += b

            if len_big != len_small:
                small_num = -heappop(small)
                ds[small_num] -= 1

                if small_num <= a:
                    heappush(small, -small_num)
                    heappush(big, a)
                    ans += a - small_num
                    db[a] += 1
                    ds[small_num] += 1

                else:
                    heappush(big, small_num)
                    db[small_num] += 1
                    heappush(small, -a)
                    ds[a] += 1
                    a = -heappop(small)
                    heappush(small, -a)
                    ans -= (len_small - 1 - ds[a] + 1) * (small_num - a)
                    ans += (len_big + 1 - db[a]) * (small_num - a)

                len_big += 1

            else:
                if len_small == 0:
                    heappush(small, -a)

                else:
                    big_num = heappop(big)
                    small_num = -heappop(small)
                    lis = [a, big_num, small_num]
                    lis.sort()
                    heappush(small, -lis[0])
                    ds[lis[0]] += 1
                    heappush(small, -lis[1])
                    ds[lis[1]] += 1
                    heappush(big, lis[2])
                    db[lis[2]] += 1
                    b = -heappop(small)
                    heappush(small, -b)
                    ans += (small_num - b) * (len_big - db[b])
                    ans += (b - small_num) * (len_small - db[b] + 1)
                    ans += abs(a - b)

                len_small += 1
        else:
            a = heappop(small)
            print(-a, ans)
            heappush(small, a)
    return


#Solve
if __name__ == '__main__':
    F()

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    if a <= 5:
        print(0)
    elif 6 <= a <= 12:
        print(b // 2)
    else:
        print(b)
    return

#B
def B():
    r, d, x = LI()
    for i in range(10):
        print(x * r - d)
        x = x * r - d
    return

#C
def C():
    n, m = LI()
    imo = [0 for i in range(n+1)]
    for _ in range(m):
        l, r = LI_()
        imo[l] += 1
        imo[r + 1] -= 1
    for i in range(1,n):
        imo[i] += imo[i - 1]
    ans = 0
    #print(imo)
    for i in imo:
        if i == m:
            ans += 1
    print(ans)
    return

#D
def D():
    n, m = LI()
    a = LI()
    bc = LIR(m)
    bc.sort(key=lambda x: x[1], reverse=True)
    a.sort()
    index = 0
    suma = 0
    for b, c in bc:
        if index + b >= n:
            if a[n - 1] <= c:
                suma += (n - index) * c
            else: 
                br = bisect_left(a, c)
                if br > index:
                    suma += (br - index) * c
                    index = br
                    break
                else:
                    break
            index = n
            break
        if a[index + b - 1] < c:
            suma += b * c
            index += b
        else:
            if a[index] < c:
                bl = bisect_left(a, c)
                suma += (bl - index) * c
                index = bl
            else:
                break
    suma += sum(a[index:])
    print(suma)

    return

#E
def E():
    n, m, k = LI()
    def cmb(n, r, mod):
        if ( r<0 or r>n ):
            return 0
        r = min(r, n-r)
        return g1[n] * g2[r] * g2[n-r] % mod

    g1 = [1, 1] 
    g2 = [1, 1]
    inverse = [0, 1] 

    for i in range( 2, n*m + 1 ):
        g1.append( ( g1[-1] * i ) % mod )
        inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
        g2.append((g2[-1] * inverse[-1]) % mod)
        
    ans = 0
    for d in range(1,n+1):
        ans += d*cmb(n * m - 2, k - 2, mod) * (n - d) * m ** 2 
    for d in range(1,m+1):
        ans += d*cmb(n * m - 2, k - 2, mod) * (m - d) * n ** 2
    print(ans%mod)
    

    
    return

#F
def F():
    q = II()
    small = []
    big = []
    len_small = 0
    len_big = 0
    ans = 0
    for i in range(q):
        query = LI()

        if query[0] == 1:
            a, b = query[1:3]
            ans += b

            if len_big != len_small:
                small_num = -heappop(small)

                if small_num <= a:
                    heappush(small, -small_num)
                    heappush(big, a)
                    ans += a - small_num

                else:
                    heappush(big, small_num)
                    heappush(small, -a)
                    a = -heappop(small)
                    heappush(small, -a)
                    ans -= (len_small - 1) * (small_num - a)
                    ans += (len_big + 1) * (small_num - a)

                len_big += 1

            else:
                if len_small == 0:
                    heappush(small, -a)

                else:
                    big_num = heappop(big)
                    small_num = -heappop(small)
                    lis = [a, big_num, small_num]
                    lis.sort()
                    heappush(small, -lis[0])
                    heappush(small, -lis[1])
                    heappush(big, lis[2])
                    b = -heappop(small)
                    heappush(small, -b)
                    ans += (small_num - b) * len_big
                    ans += (b - small_num) * len_small
                    ans += abs(a - b)

                len_small += 1
        else:
            a = heappop(small)
            print(-a, ans)
            heappush(small, a)
    return


#Solve
if __name__ == '__main__':
    F()

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    if a <= 5:
        print(0)
    elif 6 <= a <= 12:
        print(b // 2)
    else:
        print(b)
    return

#B
def B():
    r, d, x = LI()
    for i in range(10):
        print(x * r - d)
        x = x * r - d
    return

#C
def C():
    n, m = LI()
    imo = [0 for i in range(n+1)]
    for _ in range(m):
        l, r = LI_()
        imo[l] += 1
        imo[r + 1] -= 1
    for i in range(1,n):
        imo[i] += imo[i - 1]
    ans = 0
    #print(imo)
    for i in imo:
        if i == m:
            ans += 1
    print(ans)
    return

#D
def D():
    n, m = LI()
    a = LI()
    bc = LIR(m)
    bc.sort(key=lambda x: x[1], reverse=True)
    a.sort()
    index = 0
    suma = 0
    for b, c in bc:
        if index + b >= n:
            if a[n - 1] <= c:
                suma += (n - index) * c
            else: 
                br = bisect_left(a, c)
                if br > index:
                    suma += (br - index) * c
                    index = br
                    break
                else:
                    break
            index = n
            break
        if a[index + b - 1] < c:
            suma += b * c
            index += b
        else:
            if a[index] < c:
                bl = bisect_left(a, c)
                suma += (bl - index) * c
                index = bl
            else:
                break
    suma += sum(a[index:])
    print(suma)

    return

#E
def E():
    n, m, k = LI()
    def cmb(n, r, mod):
        if ( r<0 or r>n ):
            return 0
        r = min(r, n-r)
        return g1[n] * g2[r] * g2[n-r] % mod

    g1 = [1, 1] 
    g2 = [1, 1]
    inverse = [0, 1] 

    for i in range( 2, n*m + 1 ):
        g1.append( ( g1[-1] * i ) % mod )
        inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
        g2.append((g2[-1] * inverse[-1]) % mod)
        
    ans = 0
    for d in range(1,n+1):
        ans += d*cmb(n * m - 2, k - 2, mod) * (n - d) * m ** 2 
    for d in range(1,m+1):
        ans += d*cmb(n * m - 2, k - 2, mod) * (m - d) * n ** 2
    print(ans%mod)
    

    
    return

#F
def F():
    q = II()
    small = []
    big = []
    len_small = 0
    len_big = 0
    ans = 0
    for i in range(q):
        query = LI()

        if query[0] == 1:
            a, b = query[1:3]
            ans += b

            if len_big != len_small:
                small_num = -heappop(small)

                if small_num <= a:
                    heappush(small, -small_num)
                    heappush(big, a)
                    ans += a - small_num

                else:
                    heappush(big, small_num)
                    heappush(small, -a)
                    a = -heappop(small)
                    heappush(small, -a)
                    ans -= (len_small - 1) * (small_num - a)
                    ans += (len_big + 1) * (small_num - a)

                len_big += 1

            else:
                if len_small == 0:
                    heappush(small, -a)

                else:
                    big_num = heappop(big)
                    small_num = -heappop(small)
                    lis = [a, big_num, small_num]
                    lis.sort()
                    heappush(small, -lis[0])
                    heappush(small, -lis[1])
                    heappush(big, lis[2])
                    b = -heappop(small)
                    ans += (small_num - b) * len_big
                    ans += (b - small_num) * len_small
                    ans += abs(a - b)
                
                len_small += 1
        else:
            a = heappop(small)
            print(-a, ans)
            heappush(small, a)
    return


#Solve
if __name__ == '__main__':
    F()

Submission status: Wrong Answer

Solution code:
import heapq
q=int(input())
A=[]
b=0
c=0
for i in range(q):
  Q=list(map(int,input().split()))
  if Q[0]==1:
    heapq.heappush(A,Q[1])
    b=b+Q[2]
    c=c+1
  else:
    if c%2==1:
      a=A[(c-1)//2]
      print(a,end=" ")
      d=0
      for i in range(c):
        d=d+abs(A[i]-a)
      print(d+b)
    else:
      a=A[(c-2)//2]
      print(a,end=" ")
      d=0
      for i in range(c):
        d=d+abs(A[i]-a)
      print(d+b)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


def compress_coordinate(x: list, key=None, reverse=False):
    zipped = {}
    unzipped = {}
    for i, xi in enumerate(sorted(x, key=None, reverse=reverse)):
        zipped[xi] = i + 1
        unzipped[i + 1] = xi
    return zipped, unzipped


class BIT1():
    """
    Binary Indexed Tree (1-indexed)
    """
    def __init__(self, n):
        self.n = n
        self.bit = [0] * (self.n + 1)
        self.data = [0] * (self.n + 1)

    def add(self, idx, x):
        # add x to idx-th element
        # idx: 1-indexed
        self.data[idx] += x
        while idx <= self.n:
            self.bit[idx] += x
            idx += (idx & (-idx))

    def sum(self, idx):
        # get sum of [1, idx]
        # idx: 1-indexed
        s = 0
        while idx:
            s += self.bit[idx]
            idx -= (idx & (-idx))
        return s

    def bisect_left(self, w):
        # condition : always all element is not minus
        # return minimum idx where bit.sum(idx) >= w
        if w <= 0:
            return 0
        idx = 0  # self.bit[idx] < w
        k = 1 << ((self.n).bit_length() - 1)
        while k > 0:
            if idx + k <= self.n and self.bit[idx + k] < w:
                w -= self.bit[idx + k]
                idx += k
            k = k >> 1
        return idx + 1


q = int(input())
query = []
coord = set()
for _ in range(q):
    s = input()
    if s[0] == '1':
        # update query
        _, a, b = map(int, s.split())
        coord.add(a)
        query.append((1, a, b))
    else:
        # evaluation query
        query.append((2, ))

zipped, unzipped = compress_coordinate(list(coord))
a_sum = b_sum = 0
bit = BIT1(len(coord))
for i in range(q):
    if query[i][0] == 1:
        a = query[i][1]
        b = query[i][2]

        if i > 0:
            n = bit.sum(len(coord))
            idx1 = bit.bisect_left(n // 2)
            idx2 = bit.bisect_left(n // 2 + 1)
            # print(n, idx1, idx2, a)
            if idx1 != idx2:
                a_sum += min(abs(unzipped[idx1] - a), abs(unzipped[idx2] - a))
            else:
                a_sum += abs(unzipped[idx1] - a)

        b_sum += b
        bit.add(zipped[a], 2)
    else:
        n = bit.sum(len(coord))
        idx1 = bit.bisect_left(n // 2)
        print(unzipped[idx1], b_sum + a_sum)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


def compress_coordinate(x: list, key=None, reverse=False):
    zipped = {}
    unzipped = {}
    for i, xi in enumerate(sorted(x, key=None, reverse=reverse)):
        zipped[xi] = i + 1
        unzipped[i + 1] = xi
    return zipped, unzipped


class BIT1():
    """
    Binary Indexed Tree (1-indexed)
    """
    def __init__(self, n):
        self.n = n
        self.bit = [0] * (self.n + 1)
        self.data = [0] * (self.n + 1)

    def add(self, idx, x):
        # add x to idx-th element
        # idx: 1-indexed
        self.data[idx] += x
        while idx <= self.n:
            self.bit[idx] += x
            idx += (idx & (-idx))

    def sum(self, idx):
        # get sum of [1, idx]
        # idx: 1-indexed
        s = 0
        while idx:
            s += self.bit[idx]
            idx -= (idx & (-idx))
        return s

    def bisect_left(self, w):
        # condition : always all element is not minus
        # return minimum idx where bit.sum(idx) >= w
        if w <= 0:
            return 0
        idx = 0  # self.bit[idx] < w
        k = 1 << ((self.n).bit_length() - 1)
        while k > 0:
            if idx + k <= self.n and self.bit[idx + k] < w:
                w -= self.bit[idx + k]
                idx += k
            k = k >> 1
        return idx + 1


q = int(input())
query = []
coord = set()
for _ in range(q):
    s = input()
    if s[0] == '1':
        # update query
        _, a, b = map(int, s.split())
        coord.add(a)
        query.append((1, a, b))
    else:
        # evaluation query
        query.append((2, ))

zipped, unzipped = compress_coordinate(list(coord))
a_sum = b_sum = 0
bit = BIT1(len(coord))
for i in range(q):
    if query[i][0] == 1:
        a = query[i][1]
        b = query[i][2]

        if i > 0:
            n = bit.sum(len(coord))
            idx1 = bit.bisect_left(n // 2)
            idx2 = bit.bisect_left(n // 2 + 1)
            # print(n, idx1, idx2, a)
            if idx2 != len(coord) + 1:
                a_sum += min(abs(unzipped[idx1] - a), abs(unzipped[idx2] - a))
            else:
                a_sum += abs(unzipped[idx1] - a)

        b_sum += b
        bit.add(zipped[a], 2)
    else:
        n = bit.sum(len(coord))
        idx1 = bit.bisect_left(n // 2)
        print(unzipped[idx1], b_sum + a_sum)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


def compress_coordinate(x: list, key=None, reverse=False):
    zipped = {}
    unzipped = {}
    for i, xi in enumerate(sorted(x, key=None, reverse=reverse)):
        zipped[xi] = i + 1
        unzipped[i + 1] = xi
    return zipped, unzipped


class BIT1():
    """
    Binary Indexed Tree (1-indexed)
    """
    def __init__(self, n):
        self.n = n
        self.bit = [0] * (self.n + 1)
        self.data = [0] * (self.n + 1)

    def add(self, idx, x):
        # add x to idx-th element
        # idx: 1-indexed
        self.data[idx] += x
        while idx <= self.n:
            self.bit[idx] += x
            idx += (idx & (-idx))

    def sum(self, idx):
        # get sum of [1, idx]
        # idx: 1-indexed
        s = 0
        while idx:
            s += self.bit[idx]
            idx -= (idx & (-idx))
        return s

    def bisect_left(self, w):
        # condition : always all element is not minus
        # return minimum idx where bit.sum(idx) >= w
        if w <= 0:
            return 0
        idx = 0  # self.bit[idx] < w
        k = 1 << ((self.n).bit_length() - 1)
        while k > 0:
            if idx + k <= self.n and self.bit[idx + k] < w:
                w -= self.bit[idx + k]
                idx += k
            k = k >> 1
        return idx + 1


q = int(input())
query = []
coord = set()
for _ in range(q):
    s = input()
    if s[0] == '1':
        # update query
        _, a, b = map(int, s.split())
        coord.add(a)
        query.append((1, a, b))
    else:
        # evaluation query
        query.append((2, ))

zipped, unzipped = compress_coordinate(list(coord))
a_sum = b_sum = 0
bit = BIT1(len(coord))
for i in range(q):
    if query[i][0] == 1:
        a = query[i][1]
        b = query[i][2]

        if i > 0:
            n = bit.sum(len(coord))
            idx1 = bit.bisect_left((n + 1) // 2)
            # print(idx1, unzipped[idx1], a, abs(unzipped[idx1] - a))
            a_sum += abs(unzipped[idx1] - a)

        b_sum += b
        bit.add(zipped[a], 1)
    else:
        n = bit.sum(len(coord))
        idx1 = bit.bisect_left((n + 1) // 2)
        print(unzipped[idx1], b_sum + a_sum)

Submission status: Wrong Answer

Solution code:
class MultiSet:
    def __init__(self, n):
        self.N = n
        self.n = 1<<n.bit_length()
        self.data = [0] * (self.n + 1)
        self.num = 0
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s
    def add(self, i, x):#iをx個追加
        while i <= self.n:
            self.data[i] += x
            i += i & -i
        self.num+=1
    def search(self, k):#k番目の数を取得
        if k<1:
            return 0
        if k >self.num:
            return self.N+1
        x,sx = 0,0
        step = self.n
        while step:
            y = x+step
            sy = sx+self.data[y]
            if sy < k:
                x,sx = y,sy
            step >>= 1
        return x+1
    def show(self):#debug用
        res = []
        for i in range(1, self.N+1):
            c = self.sum(i)-self.sum(i-1)
            for _ in range(c):
                res.append(i)
        return res
class BIT:
    def __init__(self, n):
        self.N = n
        self.n = 1<<n.bit_length()
        self.data = [0] * (self.n + 1)
        self.S = 0
        
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        self.S+=x
        while i <= self.n:
            self.data[i] += x
            i += i & -i
import bisect
Q = int(input())
compress_list = []
query = []
for _ in range(Q):
    c, *ab = map(int, input().split())
    if c == 1:
        a, b = ab
        compress_list.append(a)
        query.append((c, a, b))
    else:
        query.append([c])
compress_list.sort()
M = MultiSet(len(compress_list))
B = BIT(len(compress_list))
S = 0
for q in query:
    if q[0] == 1:
        a, b = q[1], q[2]
        S+=b
        i = bisect.bisect_right(compress_list, a)
        M.add(i, 1)
        B.add(i, a)
    else:
        if M.num%2 == 0:
            k = M.num//2
            i = M.search(k)
            n1 = M.sum(i-1)
            x = compress_list[i-1]
            s = B.S
            s1 = B.sum(i-1)+(k-n1)*a
            s2 = s-s1
            f = s2-s1+S
        else:
            k = M.num//2+1
            i = M.search(k)
            n1 = M.sum(i-1)
            x = compress_list[i-1]
            s = B.S
            s1 = B.sum(i-1)+(k-n1)*a
            s2 = s-s1
            f = s2-s1+x+S
        print(x, f)

Submission status: Wrong Answer

Solution code:
class MultiSet:
    def __init__(self, n):
        self.N = n
        self.n = 1<<n.bit_length()
        self.data = [0] * (self.n + 1)
        self.num = 0
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s
    def add(self, i, x):#iをx個追加
        while i <= self.n:
            self.data[i] += x
            i += i & -i
        self.num+=1
    def search(self, k):#k番目の数を取得
        if k<1:
            return 0
        if k >self.num:
            return self.N+1
        x,sx = 0,0
        step = self.n
        while step:
            y = x+step
            sy = sx+self.data[y]
            if sy < k:
                x,sx = y,sy
            step >>= 1
        return x+1
    def show(self):#debug用
        res = []
        for i in range(1, self.N+1):
            c = self.sum(i)-self.sum(i-1)
            for _ in range(c):
                res.append(i)
        return res
class BIT:
    def __init__(self, n):
        self.N = n
        self.n = 1<<n.bit_length()
        self.data = [0] * (self.n + 1)
        self.S = 0
        
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        self.S+=x
        while i <= self.n:
            self.data[i] += x
            i += i & -i
import bisect
Q = int(input())
compress_list = []
query = []
for _ in range(Q):
    c, *ab = map(int, input().split())
    if c == 1:
        a, b = ab
        compress_list.append(a)
        query.append((c, a, b))
    else:
        query.append([c])
compress_list.sort()
M = MultiSet(len(compress_list))
B = BIT(len(compress_list))
S = 0
for q in query:
    if q[0] == 1:
        a, b = q[1], q[2]
        S+=b
        i = bisect.bisect_right(compress_list, a)
        M.add(i, 1)
        B.add(i, a)
    else:
        if M.num%2 == 0:
            k = M.num//2
            i = M.search(k)
            x = compress_list[i-1]
            s = B.S
            s1 = B.sum(i)
            s2 = s-s1
            f = s2-s1+S
        else:
            k = M.num//2+1
            i = M.search(k)
            x = compress_list[i-1]
            s = B.S
            s1 = B.sum(i)
            s2 = s-s1
            f = s2-s1+x+S
        print(x, f)

Submission status: Wrong Answer

Solution code:
import heapq


class DynamicMedian():
    """値をO(logN)で追加し、中央値クエリにO(1)で応える
    add(val): valを追加する
    median_low(): 小さい方の中央値(low median)を返す
    median_high(): 大きい方の中央値(high median)を返す
    """
    def __init__(self):
        self.left_q = []   # 小さい値を降順で格納する
        self.right_q = []  # 大きい値を昇順で格納する
        self.left_sum = 0
        self.right_sum = 0
        
    def add(self, val):
        """valを追加する"""
        if len(self.left_q) == len(self.right_q):
            self.left_sum += val
            val = -heapq.heappushpop(self.left_q, -val)
            self.left_sum -= val
            heapq.heappush(self.right_q, val)
            self.right_sum += val
        else:
            self.right_sum += val
            val = heapq.heappushpop(self.right_q, val)
            self.right_sum -= val
            heapq.heappush(self.left_q, -val)
            self.left_sum += val
            
    def median_low(self):
        """小さい方のmedianを返す"""
        if len(self.left_q) + 1 == len(self.right_q):
            return self.right_q[0]
        else:
            return -self.left_q[0]

    def median_high(self):
        """大きい方のmedianを返す"""
        return self.right_q[0]

q = int(input())
info = [list(map(int, input().split())) for i in range(q)]
dm = DynamicMedian()

b = 0
for i in range(q):
    if info[i][0] == 1:
        _, tmp_a, tmp_b = info[i]
        dm.add(tmp_a)
        b += tmp_b
    else:
        med = dm.median_high()
        lsum = dm.left_sum
        rsum = dm.right_sum
        lnum = len(dm.left_q)
        rnum = len(dm.right_q)
        tmp = (lnum*med - lsum) + (rnum*med - rsum)
        print(dm.median_low(), tmp+b)