Submission #135152

#TimeUsernameProblemLanguageResultExecution timeMemory
135152dualityArt Exhibition (JOI18_art)C++11
100 / 100
275 ms20968 KiB
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

pair<LLI,int> p[500000];
int main() {
    int i;
    int N;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf("%lld %d",&p[i].first,&p[i].second);
    sort(p,p+N);

    LLI best = 0,sum = p[0].second;
    for (i = 1; i < N; i++) {
        sum -= p[i].first-p[i-1].first,sum = max(sum,0LL);
        sum += p[i].second,best = max(best,sum);
    }
    printf("%lld\n",best);

    return 0;
}

Compilation message (stderr)

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]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
art.cpp:15:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%lld %d",&p[i].first,&p[i].second);
                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...