Submission #57048666

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
#define int long long
using namespace std;
void print(priority_queue<int> q)
{
  while (q.size())
  {
    printf("%lld ",q.top());
    q.pop();
  }
  puts("");
}
signed main()
{
  priority_queue<int> q;
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++)
  {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#define int long long
using namespace std;

void print(priority_queue<int> q)
{
	while (q.size())
	{
		printf("%lld ",q.top());
		q.pop();
	}
	puts("");
}

signed main()
{
	priority_queue<int> q;
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		int x;
		cin >> x;
		q.push(x);
	}
	int cnt = 0;
	while (q.size() > 1)
	{
		cnt++;
		int x = q.top();
		q.pop();
		int y = q.top();
		q.pop();
		if (x == 1 && y == 1) continue;
		if (y == 1) q.push(x - 1);
		else q.push(x - 1),q.push(y - 1);
//		print(q);
	}
	printf("%lld\n",cnt);
	return 0;
}

Submission Info

Judge Result