Submission #1127453

#TimeUsernameProblemLanguageResultExecution timeMemory
1127453Haciyev12Art Exhibition (JOI18_art)C++20
0 / 100
0 ms320 KiB
#include "bits/stdc++.h"
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
#define vll vector<ll>
#define all(v) v.begin(),v.end()
#define endl '\n'
#define pii pair<ll,ll>
using namespace std;
const ll INF = 1e18, mod = 1e9 + 7, N = 2e5 + 5;
ll gcd(ll a, ll b){
 if(b == 0){
 return a;
 }
 return gcd(b, a%b);
}
ll lcm(ll a, ll b){
    return (a / gcd(a,b)) * b;
}
void solve(){
    ll n,m;
    cin >> n;
    vector<pii>v(n);
    for(int i = 0; i < n; i++){
        cin >> v[i].F >> v[i].S;
    } 
    ll maxi = 0;
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            ll e = v[i].S + v[j].S;
            ll r = max(v[i].F, v[j].F) - min(v[i].F, v[j].F);
            maxi = max(maxi, e - r);
        }
    }
    cout << maxi << endl;
}
int main() {
    fast;
    ll t = 1;
   // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...