제출 #1207946

#제출 시각아이디문제언어결과실행 시간메모리
1207946PenguinsAreCuteBitaro's travel (JOI23_travel)C++17
15 / 100
105 ms9808 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...