oj.uz

Submission #486855

# Submission time Handle Problem Language Result Execution time Memory
486855 2021-11-13T02:20:34 Z TypeYippie Art Exhibition (JOI18_art) C++14
0 / 100
 0 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 5e5+5;
int n;
pair<long long, long long> art[N];
long long pref[N];

int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%lld%lld", &art[i].first, &art[i].second);
	}
	sort(art+1, art+n+1);
	pref[0] = 0;
	for(int i = 1; i <= n; i++){
		pref[i] = pref[i-1]+art[i].second;
	}
	priority_queue<long long> pq;
	long long ans = 0;
	for(int i = n; i > 0; i--){
		if(i < n){
			ans = max(ans, (pq.top()-pref[i-1])+art[i].first);
		}
		pq.push(pref[i]-art[i].first);
	}
	printf("%lld\n", ans);

	return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
art.cpp:12:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |   scanf("%lld%lld", &art[i].first, &art[i].second);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -