#include <bits/stdc++.h>

using namespace std;

string ltrim(const string &);
string rtrim(const string &);



/*
 * Complete the 'minTimeForRobots' function below.
 *
 * The function is expected to return a LONG_INTEGER.
 * The function accepts following parameters:
 *  1. INTEGER the_number_of_robots
 *  2. INTEGER_ARRAY rack_capacities
 */


#include<bits/stdc++.h>
using ll = long long;
using namespace std;
bool canAllocate(const vector<int>& capacities, ll k, ll maxLoad) {
    ll robotCount = 1; 
    ll currentLoad = 0; 

    for (int cap : capacities) {
        if (cap > maxLoad) return false; 
        if (currentLoad + cap > maxLoad) {
            robotCount++;
            currentLoad = cap;
            if (robotCount > k) return false;
        } else {
            currentLoad += cap;
        }
    }

    return true;
}


long long minTimeForRobots(int the_number_of_robots, std::vector<int> rack_capacities) {
    ll n = rack_capacities.size();
    if (the_number_of_robots == 0) return -1; 
    if(the_number_of_robots>n)return *max_element(rack_capacities.begin(), rack_capacities.end());
    ll low = *max_element(rack_capacities.begin(), rack_capacities.end());
    ll high = accumulate(rack_capacities.begin(), rack_capacities.end(), 0l);
    ll result = high;

    while (low <= high) {
        ll mid = low + (high - low) / 2;

        if (canAllocate(rack_capacities, the_number_of_robots, mid)) {
            result = mid;
            high = mid - 1; 
        } else {
            low = mid + 1;
        }
    }

    return result;

}

def num_players(k, scores):
    scores.sort(reverse=True)
    rank = 1
    count = 0
    i = 0

    while i < len(scores) and rank <= k:
        if scores[i] > 0:
            count += 1

        same_score_count = 1
        while i + same_score_count < len(scores) and scores[i] == scores[i + same_score_count]:
            same_score_count += 1

        rank += same_score_count
        i += same_score_count

    return count

Mock test ✅💯

from typing import List

def solution(n: int) -> int:
    count = 0
    for i in range(1, n + 1):
        for j in range(i, n + 1):
            k = int((i  2 + j  2) ** 0.5)
            if k <= n and k  2 == i  2 + j ** 2:
                count += 2 if i != j else 1
    return count