Submission #19,746

19746

2025-12-21 13:30:02

cpp17

Accepted 75/75

50ms

1908 KiB

#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n; cin >> n;
    vector<ll> v(n);
    for (ll i = 0; i < n; i++){
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    ll maxn = 0;
    for (ll i = 0; i < n; i++){
        if (maxn < v[i] + i) maxn = v[i] + i;
    }
    cout << maxn;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	0/0	24ms	824 KiB
		4	Accepted	3/3	1ms	316 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	3/3	1ms	500 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	4/4	1ms	316 KiB
		9	Accepted	4/4	1ms	316 KiB
		10	Accepted	4/4	1ms	316 KiB
		11	Accepted	4/4	1ms	316 KiB
		12	Accepted	4/4	1ms	316 KiB
		13	Accepted	4/4	50ms	1696 KiB
		14	Accepted	4/4	46ms	1696 KiB
		15	Accepted	5/5	45ms	1824 KiB
		16	Accepted	5/5	50ms	1304 KiB
		17	Accepted	5/5	46ms	1816 KiB
		18	Accepted	4/4	50ms	1752 KiB
		19	Accepted	4/4	50ms	1760 KiB
		20	Accepted	4/4	46ms	1828 KiB
		21	Accepted	4/4	32ms	1516 KiB
		22	Accepted	2/2	41ms	1908 KiB
		23	Accepted	2/2	20ms	1332 KiB