oj.uz

Submission #469924

# Submission time Handle Problem Language Result Execution time Memory
469924 2021-09-02T10:39:22 Z IvnF Art Exhibition (JOI18_art) C++14
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ull unsigned long long
#define fi first
#define se second
#define ld long double
ll n, sums;
pair<ll, ll>arr[100005];

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i=1;i<=n;++i){
		cin >> arr[i].fi >> arr[i].se;
		sums+=arr[i].se;
	}
	sort(arr+1, arr+1+n);
	ll l=1, r=n, maks=sums-(arr[n].fi-arr[1].fi);
	while(l<r){
		ll hapus_depan=(sums-arr[l].se)-(arr[r].fi-arr[l+1].fi);
		ll hapus_blkg=(sums-arr[r].se)-(arr[r-1].fi-arr[l].fi);
		if(hapus_depan > hapus_blkg){
			maks=max(maks, hapus_depan);
			sums-=arr[l].se;
			l++;
		}
		else{
			maks=max(maks, hapus_blkg);
			sums-=arr[r].se;
			r--;
		}
	}
	cout << maks << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -