Submission #338875

#TimeUsernameProblemLanguageResultExecution timeMemory
338875KerimArt Exhibition (JOI18_art)C++17
100 / 100
236 ms24940 KiB
#include "bits/stdc++.h" #define MAXN 500009 #define INF 1000000007 #define mp(x,y) make_pair(x,y) #define all(v) v.begin(),v.end() #define pb(x) push_back(x) #define wr cout<<"----------------"<<endl; #define ppb() pop_back() #define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++) #define ff first #define ss second #define my_little_dodge 46 #define debug(x) cerr<< #x <<" = "<< x<<endl; using namespace std; typedef long long ll; typedef pair<int,int> PII; template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} ll par[MAXN]; pair<ll,int>arr[MAXN]; int main(){ //freopen("file.in", "r", stdin); int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%lld%d",&arr[i].ff,&arr[i].ss); sort(arr+1,arr+n+1); for(int i=1;i<=n;i++) par[i]=par[i-1]+arr[i].ss; ll ans=0,mx=0; for(int i=1;i<=n;i++){ umax(mx,arr[i].ff-par[i-1]); umax(ans,par[i]-arr[i].ff+mx); } printf("%lld\n",ans); return 0; }

Compilation message (stderr)

art.cpp: In function 'int main()':
art.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
art.cpp:27:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |      scanf("%lld%d",&arr[i].ff,&arr[i].ss);
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...