oj.uz

Submission #1088183

# Submission time Handle Problem Language Result Execution time Memory
1088183 2024-09-14T05:08:59 Z MahmytM Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 344 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
void afterdot(int n){
	cout<<setprecision(n)<<fixed;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
// 	freopen("input.txt", "r", stdin);
// 	freopen("output.txt", "w", stdout);
	ll n;
	cin>>n;
	pair<ll,ll> a[n+2];
	for(int i=1;i<=n;i++){
		cin>>a[i].ff>>a[i].ss;
	}
	sort(a+1,a+n+1);
	map<ll,ll> m;
	for(int i=1;i<=n;i++){
		m[i]=m[i-1]+a[i].ss;
	}
	ll ans=0;
	for(int i=1;i<=n;i++){
		ans=max(ans,m[i]-(a[i].ff-a[1].ff));
	}
	cout<<ans<<endl;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 50.0

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