# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41530 | chonka | Art Exhibition (JOI18_art) | C++98 | 5 ms | 4216 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std ;
#define MAXN 500007
int n ;
pair < int , int > a[ MAXN ] ;
long long pref[ MAXN ] ;
void input ( ) {
scanf ( "%d" , &n ) ;
int i ;
for ( i = 1 ; i <= n ; i ++ ) {
scanf ( "%d%d" , &a[ i ].first , &a[ i ].second ) ;
}
sort ( a + 1 , a + n + 1 ) ;
for ( i = 1 ; i <= n ; i ++ ) {
pref[ i ] = ( pref[ i - 1 ] + a[ i ].second ) ;
}
}
void solve ( ) {
int i ;
long long mn = -a[ 1 ].first ;
long long ans = 0 ;
for ( i = 1 ; i <= n ; i ++ ) {
if ( mn > pref[ i - 1 ] - a[ i ].first ) {
mn = pref[ i - 1 ] - a[ i ].first ;
}
if ( ans < pref[ i ] - a[ i ].first - mn ) {
ans = pref[ i ] - a[ i ].first - mn ;
}
}
printf ( "%I64d\n" , ans ) ;
}
int main ( ) {
input ( ) ;
solve ( ) ;
return 0 ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |