oj.uz

Submission #531971

# Submission time Handle Problem Language Result Execution time Memory
531971 2022-03-02T02:09:59 Z nguyentunglam Art Exhibition (JOI18_art) C++14
0 / 100
 0 ms 204 KB 
#include<bits/stdc++.h>
#define forin(i, a, b) for(int i = a; i <= b; i++)
#define forde(i, a, b) for(int i = a; i >= b; i--)
#define fi first 
#define se second
#define ll long long
using namespace std;
const int N = 5e5 + 10;
pair<ll,ll> a[N];
ll res, s[N];
int main()
{
	int n; cin >> n; 
	forin(i, 1, n) 	cin >> a[i].fi >> a[i].se;
	sort(a+1, a+n+1);
	forin(i, 1, n) s[i] = s[i-1] + a[i].se;
	forin(i, 1, n-1)
	{
		forin(j, i+1,n)
		{
			res = max(res, s[j] - s[i-1] - a[j].fi + a[i].fi);
		}
	}
	cout << res; 
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 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 0 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 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -