제출 #50709

#제출 시각아이디문제언어결과실행 시간메모리
50709gnoorArt Exhibition (JOI18_art)C++17
50 / 100
1008 ms39812 KiB
#include <cstdio>
#include <map>
#include <algorithm>
#include <vector>

using namespace std;

map<long long,long long> mp;

long long sz[500100];
long long val[500100];

int main () {
	int n;
	scanf("%d",&n);
	long long a,b;
	for (int i=0;i<n;i++) {
		scanf("%lld%lld",&a,&b);
		mp[a]+=b;
	}
	int nn=0;
	for (auto &i:mp) {
		//printf("%lld %lld\n",i.first,i.second);
		sz[nn]=i.first;
		val[nn]=i.second;
		if (nn) val[nn]+=val[nn-1];
		nn++;
	}
	long long mnn=-sz[0];
	long long ans=0;
	for (int i=0;i<nn;i++) {
		ans=max(ans,val[i]-sz[i]-mnn);
		mnn=min(mnn,val[i]-sz[i+1]);
	}
	printf("%lld\n",ans);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

art.cpp: In function 'int main()':
art.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
art.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",&a,&b);
   ~~~~~^~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...