Entrepreneur

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <climits>

using namespace std;

auto comp = [](const pair<long long, long long> a, const pair<long long, long long> b) {
    return a.second > b.second;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen("input.txt", "r", stdin);

    int n;
    long long t;
    cin >> n >> t;
    priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, decltype(comp)> q(comp);

    for (int i = 0; i < n; i++) {
        long long k;
        cin >> k;
        q.emplace(k, k);
    }

    for (long long i = 0; i < t; i++) {
        auto elem = q.top();
        q.pop();
        elem.second += elem.first;
        q.push(elem);
    }
    long long maxElem = 0;
    for (int i = 0; i < n; i++) {
        auto elem = q.top();
        q.pop();
        maxElem = max(maxElem, elem.second - elem.first);
    }
    cout << maxElem;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: ACCEPTED