| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1290535 | ayran | Art Exhibition (JOI18_art) | C++20 | 1 ms | 332 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fori for(int i=0;i<n;i++)
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<pair<int,int>> art(n);
fori
cin >> art[i].first >> art[i].second;
sort(art.begin(), art.end());
int res = LLONG_MIN;
int sum = 0;
int mn = LLONG_MAX;
fori {
sum += art[i].second;
if(i > 0)
res = max(res, sum - art[i].first - mn);
mn = min(mn, sum - art[i].first);
}
cout << res;
}
| # | 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... | ||||
