| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1212365 | 2ia7a8e6a7 | Art Exhibition (JOI18_art) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
pair<int, int>p[500005];
signed main(){
int n;
cin>>n;
for(int i=1; i<=n; i++){
cin>>p[i].first>>p[i].second;
}
sort(p+1, p+n+1);
int ans=p[1].second, sum=p[1].second;
for(int i=2; i<=n; i++){
sum+=p[i].second;
ans=max(ans, sum-p[i].first+p[1].first);
}
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... | ||||
