| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1207946 | PenguinsAreCute | Bitaro's travel (JOI23_travel) | C++17 | 105 ms | 9808 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<int> x = {-1'100'000'000,2'100'000'000};
for(int i=0;i<n;i++) {
int a;
cin >> a;
x.insert(a);
}
int s;
long long ans = 0;
cin >> s >> s;
for(int i=0;i<n;i++) {
auto itR = x.lower_bound(s);
auto itL = prev(itR);
ans += min(s - (*itL), (*itR) - s);
if(s - (*itL) <= (*itR) - s)
s = *itL;
else
s = *itR;
x.erase(s);
}
cout << ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
