| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1321801 | zahra_ | Art Exhibition (JOI18_art) | C++20 | 1 ms | 332 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 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... | ||||
