# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1228877 | Tony_Tung | Art Exhibition (JOI18_art) | C++17 | 103 ms | 8264 KiB |
#include <bits/stdc++.h>
#define task ""
#define ll long long
#define fi first
#define se second
using namespace std;
const int N = 5e5 + 5;
pair<ll, ll> p[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
if (fopen(task".inp", "r"))
{
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int n; cin >> n;
for (int i = 1; i <= n; i++) cin >> p[i].fi >> p[i].se;
sort(p+1, p+n+1);
ll res = 0, mi = 0;
for (int i = 1; i <= n; i++)
{
p[i].se += p[i-1].se;
mi = min(mi, p[i-1].se - p[i].fi);
res = max(res, p[i].se - p[i].fi - mi);
}
cout << res;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |