oj.uz

답안 #1033882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033882 2024-07-25T07:27:43 Z don_ban_tinh Art Exhibition (JOI18_art) C++14
0 / 100
 0 ms 600 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define ll long long
#define S second
#define F first

int main()
{
    int n;
    scanf("%d", &n);
    vector<pair<ll, ll> > q;
    for(int i = 0; i < n; ++i)
    {
        ll a, b;
        scanf("%lld %lld", &a, &b);
        q.push_back({a, b});
    }
    sort(q.begin(), q.end());
    ll ans = -1;
    ll cur = q[0].S;
    ll check = q[0].S;
    for(int i = 1; i < n; ++i)
    {
        cur += q[i].S - (q[i].F - q[0].F);
        if(i > 1){ cur += (q[i - 1].F - q[0].F); }
        ans = max(ans, cur);
        check = max(check, q[i].S);
    }
    printf("%lld", max(ans, max(check, (ll)0)));
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
art.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         scanf("%lld %lld", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -