Submission #3,122

2023-02-17 07:45:41

cpp17

Accepted 75/75

50ms

12672 KiB

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

int main()
{
    int N, i, j;
    cin>>N;
    vector<int> hus(N);
    vector<int> db;
    db.resize(1000000);
    int mx=0;
    for (i=0; i<N; i++)
    {
        cin>>hus[i];
    }
    sort(hus.begin(), hus.end(), std::greater<int>());
    int szml=0;
    for (i=0; i<N; i++)
    {
        szml+=1;
        if (szml+hus[i]-1>mx) mx=szml+hus[i]-1;
    }
    cout<<mx<<endl;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	6ms	9532 KiB
		2	Accepted	0/0	6ms	9816 KiB
		3	Accepted	0/0	28ms	10340 KiB
		4	Accepted	3/3	4ms	10160 KiB
		5	Accepted	3/3	6ms	10116 KiB
		6	Accepted	3/3	6ms	10376 KiB
		7	Accepted	3/3	6ms	10584 KiB
		8	Accepted	4/4	4ms	10540 KiB
		9	Accepted	4/4	6ms	10800 KiB
		10	Accepted	4/4	6ms	10752 KiB
		11	Accepted	4/4	7ms	11012 KiB
		12	Accepted	4/4	6ms	11420 KiB
		13	Accepted	4/4	50ms	12156 KiB
		14	Accepted	4/4	50ms	12044 KiB
		15	Accepted	5/5	48ms	12320 KiB
		16	Accepted	5/5	50ms	12256 KiB
		17	Accepted	5/5	50ms	12404 KiB
		18	Accepted	4/4	50ms	12536 KiB
		19	Accepted	4/4	50ms	12496 KiB
		20	Accepted	4/4	46ms	12496 KiB
		21	Accepted	4/4	35ms	12520 KiB
		22	Accepted	2/2	46ms	12672 KiB
		23	Accepted	2/2	24ms	12632 KiB