| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229117 | xxducdat | Art Exhibition (JOI18_art) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
vector< pair< int , int > > art(n);
for(int i=0;i<n;i++){
cin>>art[i].first>>art[i].second;
}
sort(art.begin(),art.end());
int ans=LLONG_MIN;
int ami=art[0].first;
int s=0;
for(int i=0;i<n;i++){
s += art[i].second;
int ama=art[i].first;
int tmp=s-(ama-ami);
ans = max(ans, tmp);
}
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... | ||||
