Submission #11,904

11904

2024-11-17 12:51:36

cpp11

Accepted 75/75

46ms

900 KiB


#include <iostream>;
#include <iterator>;
# include <algorithm>;
#include <array>;
using namespace std;

const int MaxN = 100000;
int main()
{
	int husdb;
	cin >> husdb;
	int sutok[MaxN] = {};
	int max = 0;
	for (int i = 1; i <= husdb; i++)
	{
		cin >> sutok[i-1];
	}
	sort(sutok,sutok + husdb);
	max = sutok[0] + husdb-1;
	for (int i = 1; i < husdb; i++)
	{
		if (sutok[i]+ (husdb-i-1) > max)
		{
			max = sutok[i]+ (husdb-i-1);
		}
			
	}
	cout << max;

}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	1ms	572 KiB
		2	Accepted	0/0	1ms	756 KiB
		3	Accepted	0/0	23ms	572 KiB
		4	Accepted	3/3	1ms	568 KiB
		5	Accepted	3/3	1ms	568 KiB
		6	Accepted	3/3	1ms	568 KiB
		7	Accepted	3/3	1ms	568 KiB
		8	Accepted	4/4	1ms	568 KiB
		9	Accepted	4/4	1ms	568 KiB
		10	Accepted	4/4	1ms	564 KiB
		11	Accepted	4/4	2ms	568 KiB
		12	Accepted	4/4	2ms	788 KiB
		13	Accepted	4/4	45ms	784 KiB
		14	Accepted	4/4	46ms	792 KiB
		15	Accepted	5/5	45ms	796 KiB
		16	Accepted	5/5	45ms	796 KiB
		17	Accepted	5/5	46ms	628 KiB
		18	Accepted	4/4	45ms	796 KiB
		19	Accepted	4/4	45ms	568 KiB
		20	Accepted	4/4	41ms	788 KiB
		21	Accepted	4/4	32ms	788 KiB
		22	Accepted	2/2	41ms	900 KiB
		23	Accepted	2/2	19ms	636 KiB