# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201289 | abil | Art Exhibition (JOI18_art) | C++14 | 1044 ms | 20728 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 fr first
#define sc second
#define pb push_back
#define sz(s) s.size()
#define all(s) s.begin(),s.end()
#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int inf = (1e9 + 7);
pair<int,int > a[N];
main(){
int n;
cin >> n;
for(int i = 1;i <= n; i++){
scanf("%lld%lld", &a[i].fr, &a[i].sc);
}
sort(a + 1,a + 1 + n);
int ans = 0;
for(int i = 1;i <= n; i++){
int sum = 0;
for(int j = i;j <= n; j++){
sum += a[j].sc;
sum -= a[j].fr - a[i].fr;
ans = max(ans, sum);
sum += a[j].fr - a[i].fr;
}
}
cout << ans;
}
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... |