# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41530 | 2018-02-18T12:45:53 Z | chonka | Art Exhibition (JOI18_art) | C++ | 5 ms | 4216 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 4216 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 4216 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 4216 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 4216 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |