| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335755 | iderzolboo5 | Art Exhibition (JOI18_art) | C++20 | 1096 ms | 12100 KiB |
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
int main() {
ll n;
cin>>n;
ll a[n+5] ,b[n+5];
pair<ll,ll>pr[n+5];
a[0]=0;
for(ll i=1;i<=n;i++){
cin>>pr[i].ff>>pr[i].ss;
}
sort(pr+1,pr+n+1);
for(ll i=1;i<=n;i++){
a[i]=a[i-1]+pr[i].ss;
}
ll d=0;
for(ll l=1;l<=n;l++){
for(ll r=l;r<=n;r++){
d=max(d,(a[r]-a[l-1])-(pr[r].ff-pr[l].ff));
}
}
cout<<d;
}
| # | 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... | ||||
