Submission #1313355

#TimeUsernameProblemLanguageResultExecution timeMemory
1313355nambanana987Art Exhibition (JOI18_art)C++20
50 / 100
1096 ms8172 KiB
#include <bits/stdc++.h> #include <climits> using namespace std; #define f first #define s second #define all(a) a.begin(),a.end() #define sz(a) (int)a.size() #define int long long const int N=5e5+5; int n; pair<int,int> M[N]; int dp[N]; bool comp(pair<int,int>a,pair<int,int>b){ return b.f<a.f; } void solve(){ cin>>n; for(int i=1;i<=n;++i) cin>>M[i].f>>M[i].s; sort(M+1,M+n+1,comp); int ans=0; for(int i=1;i<=n;++i){ int ma=0,mi=LLONG_MAX,sum=0; for(int j=i;j<=n;++j){ sum+=M[j].s; ma=max(ma,M[j].f); mi=min(mi,M[j].f); ans=max(ans,sum-ma+mi); } } cout<<ans; } signed main(){ ios_base::sync_with_stdio(0);cin.tie(0); int T=1; while(T--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...