| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345253 | ElayV13 | Art Exhibition (JOI18_art) | C++20 | 1096 ms | 12080 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF=1e18;
int n;
vector<pair<int,int>>aw;
signed main()
{
cin>>n;
aw.resize(n);
for(int i=0;i<n;i++) cin>>aw[i].first>>aw[i].second;
sort(aw.begin(),aw.end());
vector<int>p(n);
p[0]=aw[0].second;
for(int i=1;i<n;i++) p[i]=p[i-1]+aw[i].second;
int res=-INF;
for(int i=0;i<n;i++){
int mns=((!i)?0:p[i-1]);
for(int j=i;j<n;j++){
res=max(res,p[j]-mns-aw[j].first+aw[i].first);
}
}
cout<<res<<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... | ||||
