Two-pointer shortest subarray with sum at least k

This function returns the length of the shortest contiguous subarray whose sum is at least k, using the standard grow-right, shrink-left window. What does it return for a = {1, -5, 2, 2} and k = 4?

main.cpp
int shortestAtLeastK(const vector<int>& a, int k) {
    int best = INT_MAX, sum = 0, lo = 0;
    for (int hi = 0; hi < (int)a.size(); hi++) {
        sum += a[hi];
        while (sum >= k && lo <= hi) {
            best = min(best, hi - lo + 1);
            sum -= a[lo++];
        }
    }
    return best == INT_MAX ? -1 : best;
}

35 of 46 in Data Structures & Algorithms