| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334512 | yc11 | Art Exhibition (JOI18_art) | C++20 | 1096 ms | 11960 KiB |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
vector<pair<int,int> > n1;
signed main(){
cin>>n;
for (int i = 0;i<n;i++){
int a,b;
cin>>a>>b;
n1.push_back(make_pair(a,b));
}
sort(n1.begin(),n1.end());
int ans = 0;
vector<int> pre;
pre.resize(n);
pre[0] = n1[0].second;
for (int i = 1;i<n;i++){
pre[i] = n1[i].second+pre[i-1];
}
int l = 0;
for (int i = 0;i<n;i++){
int ans1 = -n1[i].first;
for (int j = i;j>=l;j--){
ans1 = ans1+n1[j].second;
if (ans1+n1[j].first>ans){
ans = ans1+n1[j].first;
}
}
}
cout<<ans<<"\n";
return 0;
}
| # | 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... | ||||
