제출 #1321801

#제출 시각아이디문제언어결과실행 시간메모리
1321801zahra_Art Exhibition (JOI18_art)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
    int n;
    cin >> n;
    vector<pair<int , int>>v(n);
    for(int i = 0 ; i < n ; i++){
        cin >> v[i].first >> v[i].second;
    }
    int ans = -1;
    for(int i = 0 ; i < n ; i++){
        for(int j = i + 1 ; j < n ; j++){
            int s = v[i].second + v[j].second;
            int maks = max(v[i].first, v[j].first);
            int mini = min(v[i].first, v[j].first);
            ans = max(ans , s - (maks - mini));
        }
    }
    cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...