Entrepreneur

#include <iostream>
#include <algorithm>
#include <unordered_map>

#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int main(){
    long long n, t;

    cin >> n;
    cin >> t;
    // n number of machines, t number of cars



    unordered_map<int, long long> man_times;
    priority_queue<pair<int,int> , vector<pair<int,int>>, greater<pair<int,int>> > pq;
    priority_queue<pair<int,int> , vector<pair<int,int>>, greater<pair<int,int>> > nq;
    priority_queue<pair<int,int> , vector<pair<int,int>>, greater<pair<int,int>> > temp;

    long long b;
    int i = 0;
    while (cin >> b)
    {
        man_times[i++] = b;
        pq.push(make_pair(b, i));
    }

    long long cars = 0;
    long long time = 0;

    while (cars < t)
    {   
        pair<int,int> top = pq.top();
        int min_time = top.first;
        while (!pq.empty()) {
            pair<int, int> cur = pq.top();
            pq.pop();
            int k = cur.first;
            if (k == min_time)
            {
                ++cars;
                nq.push(make_pair(i, man_times[cur.second]));
            }
            else
            {
                nq.push(make_pair(i, k - min_time));
            }
        }
        temp = pq;
        pq = nq;
        nq = temp;

        time += min_time;

    }

    

    cout << time;
    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: WRONG ANSWER

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