Entrepreneur

#include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;


int main() {
    
    long n, t, aux;

    cin >> n >> t; 
    vector<long> v;

    for (int i = 0; i < n; ++i){
        cin >> aux;
        v.push_back(aux);
    }

    sort(v.begin(), v.end());

    vector<long> machines = vector<long>(n, 0);

    long cars = 0;

    while (cars < t){
        long min = machines[0] * v[0] + v[0];
        int pos = 0;
        for (int i = 0; i < n; ++i){
            if (machines[i] * v[i] + v[i] < min)
                {
                    pos = i;
                    min = machines[i] * v[i] + v[0];
                }
        }
            machines[pos] += 1;
            cars++;


    }

    long max = machines[0] * v[0];
    for (int i = 0; i < n; ++i){
        //cout << machines[i] << " ";
        if (machines[i] * v[i] > max)
            max = machines[i] * v[i]; 
    }
    //cout << endl;
    cout << max << endl;

}

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: WRONG ANSWER

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