Submission #553247

#	Time	Username	Problem	Language	Result	Execution time	Memory
553247		sandry24	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	212 KiB

art

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

bool cust_sort(ll a, ll b){

}

void solve(){
    int n;
    cin >> n;
    vector<pair<ll, ll>> a(n);
    for(int i = 0; i < n; i++)
        cin >> a[i].f >> a[i].s;
    sort(a.begin(), a.end());
    vector<ll> prefix(n);
    prefix[0] = a[0].s;
    for(int i = 1; i < n; i++)
        prefix[i] = a[i].s + prefix[i-1];
    ll ans = 0;
    for(int i = 0; i < n; i++){
        for(int j = i+1; j < n; j++){
            ll temp = 0;
            if(i == 0)
                temp += prefix[j];
            else
                temp += prefix[j] - prefix[i];
            temp -= a[j].f - a[i].f;
            ans = max(ans, temp);
        }
    }
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Compilation message (stderr)

art.cpp: In function 'bool cust_sort(ll, ll)':
art.cpp:14:1: warning: no return statement in function returning non-void [-Wreturn-type]
   14 | }
      | ^

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