oj.uz

답안 #919970

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919970 2024-02-02T00:14:54 Z thunopro Art Exhibition (JOI18_art) C++14
0 / 100
 1 ms 2392 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 500009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

const int mod = 1e9+7; 
const int INF = 1e9; 

typedef vector<int> vi; 
typedef pair<int,int> pii;
typedef vector<pii> vii;  
typedef vector<ll> vl;

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a > mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ;
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

typedef pair<ll,ll> pll ; 
int n ; 
pll a [maxn] ; 
ll sum [maxn] ; 
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 
	cin >> n ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i].fi >> a [i].se ;
	sort (a+1,a+n+1) ; 
	for ( int i = 1 ; i <= n ; i ++ ) sum [i] = sum [i-1] + a[i].se ; 
	ll Min = 1e18 ; 
	ll res = - 1e18 ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		chkmax (res,a[i].fi-a[i].se) ; 
		chkmax (res,sum[i]-a[i].fi-Min) ; 
		chkmin (Min,sum[i-1]-a[i].fi) ; 	
	} 
	cout << res ; 
}

Compilation message

art.cpp: In function 'void rf()':
art.cpp:40:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -