Algorithm/acmicpc.net/source/15235.cpp at master · tdm1223/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
// 15235. Olympiad Pizza
// 2022.02.23
// 자료 구조
#include<iostream>
#include<vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> v(n);
    vector<int> ans(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }

    int nums = n;
    int count = 0;
    while (nums > 0)
    {
        for (int i = 0; i < n; i++)
        {
            if (v[i] > 0)
            {
                v[i]--;
                count++;
            }

            if (v[i] == 0)
            {
                ans[i] = count;
                nums--;
                v[i] = -1;
            }
        }
    }

    for (int i = 0; i < ans.size(); i++)
    {
        cout << ans[i] << " ";
    }
    cout << endl;
    return 0;
}