| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 157124 | GioChkhaidze | Art Exhibition (JOI18_art) | C++14 | 261 ms | 24824 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.
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
const int N=500005;
long long n,ans,d[N];
pair < long long , long long > p[N];
int main() {
ios::sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) {
cin>>p[i].F>>p[i].S;
}
sort(p+1,p+n+1);
for (int i=1; i<=n; i++) {
d[i]=max(d[i-1]+p[i].S+p[i-1].F-p[i].F,p[i].S);
ans=max(ans,d[i]);
}
cout<<ans<<endl;
return 0;
}
| # | 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... | ||||
