Submission #1,777

2022-12-02 22:36:17

cpp11

Accepted 75/75

23ms

5168 KiB

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, m=0;
    cin >> n;
    vector<int>vec;
    for (size_t i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        vec.push_back(a);
    }
    sort(vec.begin(), vec.end());
    for (int i = 0; i < n; i++)
    {
        m = max(m, vec[i] + n - i - 1);
    }
    cout << m << endl;
    return 0;
}
/*
5
3 4 9 2 1
-9

5
5 4 3 5 3
-7
*/

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	3ms	1828 KiB
		2	Accepted	0/0	2ms	2056 KiB
		3	Accepted	0/0	12ms	2860 KiB
		4	Accepted	3/3	2ms	2380 KiB
		5	Accepted	3/3	2ms	2596 KiB
		6	Accepted	3/3	2ms	2788 KiB
		7	Accepted	3/3	2ms	2984 KiB
		8	Accepted	4/4	2ms	3064 KiB
		9	Accepted	4/4	2ms	3192 KiB
		10	Accepted	4/4	2ms	3436 KiB
		11	Accepted	4/4	2ms	3420 KiB
		12	Accepted	4/4	2ms	3488 KiB
		13	Accepted	4/4	23ms	4688 KiB
		14	Accepted	4/4	23ms	4684 KiB
		15	Accepted	5/5	21ms	4956 KiB
		16	Accepted	5/5	23ms	4820 KiB
		17	Accepted	5/5	23ms	4812 KiB
		18	Accepted	4/4	23ms	4888 KiB
		19	Accepted	4/4	23ms	4884 KiB
		20	Accepted	4/4	16ms	4944 KiB
		21	Accepted	4/4	17ms	5012 KiB
		22	Accepted	2/2	20ms	5168 KiB
		23	Accepted	2/2	10ms	5016 KiB