제출 #1179744

#제출 시각아이디문제언어결과실행 시간메모리
1179744nekolieExhibition (JOI19_ho_t2)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; pair<long long,long long> asp[n]; for (int i = 0; i < n; i++) cin >> asp[i].first >> asp[i].second; sort(asp,asp+n); long long odp = -1000000000000000000, suma = 0; priority_queue<long long> q; for (int i = 0; i < n; i++) { q.push(asp[i].first-suma), suma += asp[i].second; odp = max(odp,suma-asp[i].first+q.top()); } cout << odp << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...