Rudolf and the Another Competition
Rudolf has registered for a programming competition that will follow the rules of ICPC. The rules imply that for each solved problem, a participant gets $$$1$$$ point, and also incurs a penalty equal to the number of minutes passed from the beginning of the competition to the moment of solving the problem. In the final table, the participant with the most points is ranked higher, and in case of a tie in points, the participant with the lower penalty is ranked higher.In total, $$$n$$$ participants have registered for the competition. Rudolf is a participant with index $$$1$$$. It is known that $$$m$$$ problems will be proposed. And the competition will last $$$h$$$ minutes.A powerful artificial intelligence has predicted the values $$$t_{i, j}$$$, which represent the number of minutes it will take for the $$$i$$$-th participant to solve the $$$j$$$-th problem.Rudolf realized that the order of solving problems will affect the final result. For example, if $$$h = 120$$$, and the times to solve problems are [$$$20, 15, 110$$$], then if Rudolf solves the problems in the order:  $$${3, 1, 2}$$$, then he will only solve the third problem and get $$$1$$$ point and $$$110$$$ penalty.  $$${1, 2, 3}$$$, then he will solve the first problem after $$$20$$$ minutes from the start, the second one after $$$20+15=35$$$ minutes, and he will not have time to solve the third one. Thus, he will get $$$2$$$ points and $$$20+35=55$$$ penalty.  $$${2, 1, 3}$$$, then he will solve the second problem after $$$15$$$ minutes from the start, the first one after $$$15+20=35$$$ minutes, and he will not have time to solve the third one. Thus, he will get $$$2$$$ points and $$$15+35=50$$$ penalty. Rudolf became interested in what place he will take in the competition if each participant solves problems in the optimal order based on the predictions of the artificial intelligence. It will be assumed that in case of a tie in points and penalty, Rudolf will take the best place.
In the first example, Rudolf will get $$$2$$$ points and $$$50$$$ penalty minutes. The second participant will solve only one problem and get $$$1$$$ point and $$$90$$$ penalty minutes. And the third participant will solve all $$$3$$$ problems and get $$$3$$$ points and $$$240$$$ penalty minutes. Thus, Rudolf will take the second place.In the second example, both participants will get $$$1$$$ point and $$$30$$$ penalty minutes. In case of a tie in points, Rudolf gets the better position, so he will take the first place.In the third example, Rudolf is the only participant, so he will take the first place.In the fourth example, all participants can solve two problems with penalty of $$$25 = 8 + (8 + 9)$$$, $$$24 = 7 + (7 + 10)$$$ and $$$26 = 8 + (8 + 10)$$$, respectively, thanks to the penalty, the second participant gets the first place, and Rudolf gets the second.
The first line contains an integer $$$t$$$ ($$$1 \le t \le 10^3$$$) — the number of test cases.Then follow the descriptions of the test cases.The first line of each test case contains three integers $$$n, m, h$$$ ($$$1 \le n \cdot m \le 2 \cdot 10^5, 1 \le h \le 10^6$$$) — the number of participants, the number of problems, and the duration of the competition, respectively.Then there are $$$n$$$ lines, each containing $$$m$$$ integers $$$t_{i, j}$$$ ($$$1 \le t_{i, j} \le 10^6$$$) — the number of minutes it will take for the $$$i$$$-th participant to solve the $$$j$$$-th problem.The sum of $$$n \cdot m$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.
For each test case, output an integer — Rudolf's place in the final table if all participants solve problems in the optimal order.
import sys

def solution():
    for _ in range(int(sys.stdin.readline())):
        (n, m, h) = map(int, input().split())
        position = n
        ph = h
        Rpoint = 0
        Rpenalty = 0
        time = 0
        result = [int(c) for c in sys.stdin.readline().split(' ')]
        result.sort()
        for i in result:
            if i <= ph:
                Rpoint += 1
                ph -= i
                time += i
                Rpenalty += time
        for _ in range(n - 1):
            ph = h
            point = 0
            penalty = 0
            time = 0
            result = [int(c) for c in sys.stdin.readline().split(' ')]
            result.sort()
            for i in result:
                if i <= ph:
                    point += 1
                    ph -= i
                    time += i
                    penalty += time
            if Rpoint > point:
                position -= 1
            if Rpoint == point and Rpenalty <= penalty:
                position -= 1
        print(position)
if __name__ == '__main__':
    solution()
import sys
input = sys.stdin.readline

def solve():
    (n, m, h) = map(int, input().split())
    place = 1
    (my_point, my_penalty) = (None, None)
    for i in range(n):
        (point, penalty, time) = (0, 0, 0)
        for j in sorted(map(int, input().split())):
            if time + j > h:
                break
            time = time + j
            point += 1
            penalty += time
        if i == 0:
            my_point = point
            my_penalty = penalty
        elif point > my_point:
            place += 1
        elif point == my_point:
            if penalty < my_penalty:
                place += 1
        else:
            pass
    print(place)
for dataset in range(int(input())):
    solve()
import sys
input = sys.stdin.buffer.readline
P = lambda : map(int, input().split())
for _ in range(int(input())):
    (n, m, h) = P()

    def pts():
        t = c = tt = 0
        for ttt in sorted(P()):
            if tt + ttt > h:
                break
            tt += ttt
            t += tt
            c += 1
        return (c, -t)
    r = pts()
    place = 1
    for i in range(n - 1):
        place += pts() > r
    print(place)