답안 #1033860

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033860 2024-07-25T07:08:54 Z don_ban_tinh Art Exhibition (JOI18_art) C++14
0 / 100
0 ms 348 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 = q[0].S;
    ll cur = 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); }
        if(cur > ans) ans = cur;
    }
    printf("%lld", ans);
}

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);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -