#include <iostream>
#include <vector>
#include <algorithm>
long long solution(int n, long long c, int d, std::vector<int> arr) {
    sort(arr.begin(), arr.end());
    long long val1 = arr[n-1], days = d;
    if (val1 * days < c) return -1; 
    if (val1 >= c) return -1;
    long long ans = 1e16, st = 0, en = 1e16;
    while (st <= en) {
        long long mid = st + (en - st) / 2;
        long long p = mid + 1;
        int el = 0;
        long long cur = 0;
        for (int i = n - 1; i >= 0; i--) {
            el++;
            if (el > p) break; 
            cur += (days / p) * (long long)arr[i];
            if (days % p >= el) cur += (long long)arr[i];
        }
                if (cur >= c) {
            ans = mid;
            st = mid + 1; 
        } else {
            en = mid - 1;
        }
    }
    return ans;
}

import requests
def getArticleTitles(author):
    titles = []
    page = 1
    base_url = f"https://jsonmock.hackerrank.com/api/articles?author={author}&page="
    while True:
        response = requests.get(base_url + str(page))
        data = response.json()
        for article in data['data']:
            if article['title']:
                titles.append(article['title'])
            elif article['story_title']:
                titles.append(article['story_title'])
        if page >= data['total_pages']:
            break
        page += 1
    return titles