제출 #848002

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
848002	2023-09-11 02:01:37	qqspeed20015	Palembang Bridges (APIO15_bridge)	C++14	100 / 100	103 ms	8800 KiB

bridge

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
priority_queue <long long> leftBridge;
priority_queue <long long, vector <long long>, greater <long long>> rightBridge;
long long leftSum = 0, rightSum = 0;
bool comparePriority(pair <long long, long long> firstCitizen, pair <long long, long long> secondCitizen) {
  return (firstCitizen.first + firstCitizen.second < secondCitizen.first + secondCitizen.second);
}
void insertCitizen(long long placeCoordinate) {
  long long median = leftBridge.empty() ? LLONG_MAX : leftBridge.top();
  if (placeCoordinate <= median) {
    leftBridge.push(placeCoordinate);
    leftSum += placeCoordinate;
  } else {
    rightBridge.push(placeCoordinate);
    rightSum += placeCoordinate;
  }
  int numCitizensInLeft = (int) leftBridge.size();
  int numCitizensInRight = (int) rightBridge.size();
  if (numCitizensInRight + 1 < numCitizensInLeft) {
    long long largestSmaller = leftBridge.top();
    leftBridge.pop();
    rightBridge.push(largestSmaller);
    leftSum -= largestSmaller;
    rightSum += largestSmaller;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 9 / 9
• Subtask 4: 32 / 32
• Subtask 5: 37 / 37