Submission details
Task:Entrepreneur
Sender:aalto25a_002
Submission time:2025-09-03 17:37:31 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1--details
#2--details
#3--details
#4--details
#5--details
#6--details
#7--details
#8--details
#9--details
#10--details
#11--details
#12--details
#13--details
#14--details
#15--details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:17:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Code

#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);
    }
    vector<long long> a;
    for (int i = 0; i < n; i++) {
        auto elem = q.top();
        q.pop();
        a.push_back(elem.second - elem.first);
    }
    sort(a.begin(), a.end(), greater<>());
    cout << a[0];
}

Test details

Test 1

Verdict:

input
10 10
6 5 1 2 1 5 10 4 6 6

correct output
4

user output
(empty)

Test 2

Verdict:

input
10 10
6 6 4 3 4 9 3 2 6 10

correct output
6

user output
(empty)

Test 3

Verdict:

input
10 10
5 4 10 7 8 4 1 8 9 2

correct output
5

user output
(empty)

Test 4

Verdict:

input
1 1000000000
1

correct output
1000000000

user output
(empty)

Test 5

Verdict:

input
1 1000000000
1000000000

correct output
1000000000000000000

user output
(empty)

Test 6

Verdict:

input
1000 1000
271 687 392 992 11 410 702 870...

correct output
223

user output
(empty)

Test 7

Verdict:

input
1000 1000
598 523 703 794 737 689 724 26...

correct output
282

user output
(empty)

Test 8

Verdict:

input
200000 1000000000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5000

user output
(empty)

Test 9

Verdict:

input
200000 1
760045594 599341056 300698860 ...

correct output
8214

user output
(empty)

Test 10

Verdict:

input
200000 1000000000
33941840 210038922 596070148 7...

correct output
371045814100

user output
(empty)

Test 11

Verdict:

input
25 1000000000
1000000000 1 1 1 1 1 1 1 1 1 1...

correct output
41666667

user output
(empty)

Test 12

Verdict:

input
12 1000000000
1 1 1 1 1 1 1 1 1 1 1 10000000...

correct output
90909091

user output
(empty)

Test 13

Verdict:

input
23 1000000000
1000000000 1000000000 10000000...

correct output
43478261000000000

user output
(empty)

Test 14

Verdict:

input
23 1000000000
1000000000 1000000000 10000000...

correct output
43478261000000000

user output
(empty)

Test 15

Verdict:

input
3 3
10 11 12

correct output
12

user output
(empty)