| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334425 | enson | Art Exhibition (JOI18_art) | C++20 | 1096 ms | 16072 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
pair<int, int>A[N];
int P[N+1] = {0}, B[N] = {0};
for(int i = 0; i < N; i++){
cin >> A[i].first >> A[i].second;
}
sort(A, A+N);
for(int i = 0; i < N; i++){
P[i+1] = P[i] + A[i].second;
}
for(int i = 0; i < N; i++){
for(int j = i+1; j < N+1; j++){
B[i] = max(B[i], P[j]-P[i]-A[j-1].first+A[i].first);
}
}
cout << *max_element(B, B+N);
}
| # | 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... | ||||
