Submission #699412

#	Time	Username	Problem	Language	Result	Execution time	Memory
699412		Galal012	Art Exhibition (JOI18_art)	C++17	0 / 100	174 ms	308 KiB

art

#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
using namespace std;
int n, ans = 0;
pair <int, int> pr[5002];
void solve(int i, int j)
{
    if (i == n || j == n)
        return;
    int tot = pr[i].second;
    if (j != 0)
        tot -= pr[j-1].second;
    ans = max(ans, tot - (pr[i].first-pr[j].first));
    if (i+1 < n)
        solve(i+1, j);
    if (j+1 <= i)
        solve(i, j+1);
}
signed main()
{
    IOS;
    cin >> n;
    pr[0].first = pr[0].second = 0;
    for (int i = 1; i <= n; i++)
        cin >> pr[i].first >> pr[i].second;
    sort(pr, pr+n+1);
    for (int i = 1; i <= n; i++)
        pr[i].second += pr[i-1].second;
    solve(0, 0);
    cout << ans;
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50