Submission #3,108

2023-02-15 18:24:05

cpp17

Accepted 75/75

54ms

6004 KiB

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n;
	cin>>n;
	priority_queue<int> q; 

	for (int i=0; i<n;i++){
		int x; 
		cin>>x;
		q.push(x);
	}
	int cnt=0; 
	int ans=q.top();
	q.pop();
	while (!q.empty()){
		cnt++;
		ans=max(ans, q.top()+cnt);
		q.pop();
	}
	cout<<ans; 
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	3ms	1684 KiB
		2	Accepted	0/0	3ms	1856 KiB
		3	Accepted	0/0	28ms	2712 KiB
		4	Accepted	3/3	3ms	2580 KiB
		5	Accepted	3/3	3ms	2540 KiB
		6	Accepted	3/3	3ms	2752 KiB
		7	Accepted	3/3	3ms	2992 KiB
		8	Accepted	4/4	3ms	3228 KiB
		9	Accepted	4/4	3ms	3312 KiB
		10	Accepted	4/4	3ms	3376 KiB
		11	Accepted	4/4	3ms	3748 KiB
		12	Accepted	4/4	3ms	3700 KiB
		13	Accepted	4/4	54ms	4988 KiB
		14	Accepted	4/4	54ms	5196 KiB
		15	Accepted	5/5	54ms	5336 KiB
		16	Accepted	5/5	54ms	5416 KiB
		17	Accepted	5/5	54ms	5504 KiB
		18	Accepted	4/4	54ms	5640 KiB
		19	Accepted	4/4	54ms	5672 KiB
		20	Accepted	4/4	45ms	5776 KiB
		21	Accepted	4/4	41ms	5860 KiB
		22	Accepted	2/2	54ms	6004 KiB
		23	Accepted	2/2	23ms	5960 KiB