Submission

Status:

PPPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: Buktep

Problemset: B.Nai/SiraSira

Language: cpp

Time: 0.002 second

Submitted On: 2025-09-25 10:39:50

#include<bits/stdc++.h>
using namespace std;
#define int long long

int32_t main()
{
    cin.tie(0);ios::sync_with_stdio(0);
    int n;cin>>n;
    vector<int> arr(n);
    int mx=-1,mn=-1;
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
        arr[i]*=2;
        mx=max(mx,arr[i]);
        mn=min(mn,arr[i]);
    }
    for(int i=0;i<mx;i++)
    {
        for(int j=0;j<(int)arr.size();j++)
        {
            if(arr[j] == mx or i >= mx-arr[j])
            {
                for(int k=0;k<4;k++)
                {
                    cout<<"#";
                }
            }
            else
            {
                for(int k=0;k<4;k++)
                {
                    cout<<" ";
                }
            }

            for(int k=0;k<2;k++)
            {
                cout<<" ";
            }
        }
        cout<<'\n';
    }

    return 0;
}