Submission #678531

#TimeUsernameProblemLanguageResultExecution timeMemory
678531anhduc2701Art Exhibition (JOI18_art)C++17
100 / 100
194 ms12068 KiB
/* #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #pragma GCC optimize("unroll-loops") */ #include<bits/stdc++.h> #define int long long #define all(x) x.begin(), x.end() #define len(x) ll(x.size()) #define eb emplace_back #define PI 3.14159265359 #define fi first #define se second #define mp make_pair #define pb push_back #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) #define BIT(x,i) (1&((x)>>(i))) #define MASK(x) (1LL<<(x)) #define task "tnc" using namespace std; typedef long long ll; const ll INF=4e18; const int maxn=1e6+5; const int mod=1e9+7; const int mo=998244353; using pi=pair<ll,ll>; using vi=vector<ll>; using pii=pair<pair<ll,ll>,ll>; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n; pair<int,int> a[500005]; int pref[500005]; signed main() { cin.tie(0),cout.tie(0)->sync_with_stdio(0); //freopen(task".inp" , "r" , stdin); //freopen(task".out" , "w" , stdout); cin>>n; int ans=0; for(int i=1;i<=n;i++){ cin>>a[i].fi>>a[i].se; ans=max(ans,a[i].se); } sort(a+1,a+1+n); int ma0=-INF; int vt=0; for(int i=1;i<=n;i++){ pref[i]=pref[i-1]+a[i].se; ans=max(ans,pref[i]-a[i].fi+ma0); if(a[i].fi-pref[i-1]>ma0){ ma0=a[i].fi-pref[i-1]; } } cout<<ans; return 0; }

Compilation message (stderr)

art.cpp: In function 'int main()':
art.cpp:47:6: warning: unused variable 'vt' [-Wunused-variable]
   47 |  int vt=0;
      |      ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...