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