| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1283857 | quan606303 | Art Exhibition (JOI18_art) | C++20 | 125 ms | 12112 KiB | 
/*
 * @Author: RMQuan 
 * @Date: 2025-10-27 15:36:57 
 * @Last Modified by: RMQuan
 * @Last Modified time: 2025-10-27 15:40:05
 */
 /*idea : 
 
 
 
 */
 #include <bits/stdc++.h>
 bool M1;
 #define int long long
 #define ll long long
 #define INTMAX INT_MAX
 #define INTMIN INT_MIN
 #define LONGMAX LLONG_MAX
 #define LONGMIN LLONG_MIN
 #define fi first
 #define se second
 #define memfull(a,b) memset(a,b,sizeof(a));
 #define endl '\n'
 #define TASK "TEST"
 #define file() if (fopen(TASK".inp","r")){freopen(TASK".inp","r",stdin); freopen(TASK".out","w",stdout);}
 using namespace std;
 const int MOD=1e9+7;
 const int maxn=5e5+7;
 const int inf=1e18;
 pair<int,int> a[maxn];
 int n,pre[maxn];
 int32_t main()
 {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    file();
    cin>>n;
    for (int i=1;i<=n;i++)cin>>a[i].fi>>a[i].se;
    sort(a+1,a+1+n);
    for (int i=1;i<=n;i++)pre[i]=pre[i-1]+a[i].se;
    int ans=-inf,mn=inf;
    for (int i=1;i<=n;i++)
    {
      mn=min(mn,pre[i-1]-a[i].fi);
      ans=max(ans,(pre[i]-a[i].fi)-mn);
    }
    cout<<ans;
    bool M2;
    cerr<<"-------------------------------------------------"<<endl;
    cerr<<"Time : "<<clock()<<" ms"<<endl;
    cerr<<"Memory : "<<abs(&M2-&M1)/1024/1024<<" MB"<<endl;
    cerr<<"-------------------------------------------------"<<endl;
    return 0;
 }
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
