답안 #384122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
384122 2021-03-31T13:52:26 Z LucaDantas Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
1 ms 364 KB
#include <cstdio>
#include <queue>

std::priority_queue<long long> q;

int main() {
	long long d, ans = 0;
	int n; scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		int a, b; scanf("%d %d", &a, &b);
		d += a - b;
		if(d < 0) ans += -d;
		if(q.size() && d < q.top()) ans += q.top() - (d<0?0:d), q.pop(), q.push(d<0?0:d);
		q.push(d<0?0:d);
	}
	printf("%lld\n", ans);
}

Compilation message

bulves.cpp: In function 'int main()':
bulves.cpp:8:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |  int n; scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
bulves.cpp:10:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |   int a, b; scanf("%d %d", &a, &b);
      |             ~~~~~^~~~~~~~~~~~~~~~~
bulves.cpp:11:5: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized]
   11 |   d += a - b;
      |   ~~^~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -