| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1229793 | xxducdat | Art Exhibition (JOI18_art) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
vector< pair< int , int > > art(n);
for(int i=0;i<n;i++){
cin>>art[i].first>>art[i].second;
}
int ans=LLONG_MIN;
int ami=art[0].first;
int l=0,s=0;
sort(art.begin(),art.end());
for (int r=0; r<n;r++) {
s += art[r].second;
int ama = art[r].first;
int ami = art[l].first;
ans = max(ans,s-(ama - ami));
}
cout<<ans;
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... | ||||
