제출 #1351308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1351308		dex111222333444555	Art Exhibition (JOI18_art)	C++20	100 / 100	98 ms	8260 KiB

art

#include <bits/stdc++.h>
#define all(v) begin(v), end(v)
#define ii pair<int, int>
#define fi first
#define se second
#define siz(v) (int)(v).size()
#define lli pair<long long, int>
#define dbg(x) "[" #x " = " << x << "]"
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))

using namespace std;

const long long inf = 1e18 + 123;
const int mod = 1e9 + 7, infINT = 1e9 + 1321;

template<class X, class Y> bool minimize(X &x, const Y &y){return x > y ? x = y, 1: 0;}
template<class X, class Y> bool maximize(X &x, const Y &y){return x < y ? x = y, 1: 0;}

const int MAXN = 5e5 + 5;

int numVal;
lli val[MAXN];

void input(){
    cin >> numVal;
    for(int i = 1; i <= numVal; i++) cin >> val[i].fi >> val[i].se;
}

void solve(){
    sort(val + 1, val + 1 + numVal);
    long long sum = 0, res = -inf, mx = -inf;
    for(int i = 1; i <= numVal; i++){
        mx = max(mx, -sum + val[i].fi);
        sum += val[i].se;
        res = max(res, sum - val[i].fi + mx);
    }
    cout << res << '\n';
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define task "test"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    input();
    solve();
    cerr << (1.0 * clock()) / CLOCKS_PER_SEC << ".s\n";
}

컴파일 시 표준 에러 (stderr) 메시지

art.cpp: In function 'int main()':
art.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:46:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50