제출 #1308004

#제출 시각아이디문제언어결과실행 시간메모리
1308004dimitris71Art Exhibition (JOI18_art)C++17
100 / 100
137 ms8232 KiB
#include <cstdio>
#include <algorithm> 
#include <vector> 
#include <utility>
using namespace std; 

vector < pair < long long, int > > X;

int main() {
    int N; long long res = 0, best = 1e18, sum = 0;
    scanf("%d", &N); X.resize(N);

    for (int i=0; i<N; i++) {
        long long a; int b;
        scanf("%lld%d", &a, &b);
        X[i] = make_pair(a, b);
    }
    sort(X.begin(), X.end());
    
    for (int i=0; i<N; i++) {
        best = min(best, sum - X[i].first);
        sum += X[i].second;
        res = max(res, sum - X[i].first - best);
    }
    printf("%lld\n", res);

}

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

art.cpp: In function 'int main()':
art.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d", &N); X.resize(N);
      |     ~~~~~^~~~~~~~~~
art.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%lld%d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...