# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
204067 | Kastanda | Art Exhibition (JOI18_art) | C++11 | 286 ms | 20996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// In The Name Of The Queen
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 500005;
int n;
pair < ll , ll > A[N];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i ++)
scanf("%lld%lld", &A[i].x, &A[i].y);
sort(A + 1, A + n + 1);
ll MX = 0, Mxp = 0;
for (int i = 1; i <= n; i ++)
{
MX = max(MX, A[i].y);
MX = max(MX, Mxp + A[i].y - A[i].x);
Mxp = max(Mxp + A[i].y, A[i].x + A[i].y);
}
return !printf("%lld\n", MX);
}
Compilation message (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... |