# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134562 | 2019-07-23T03:59:43 Z | 이온조(#3239) | Sushi (JOI16_sushi) | C++14 | 116 ms | 8256 KB |
#include <bits/stdc++.h> using namespace std; int X[400009]; int main() { priority_queue<int> pq; int N, Q; scanf("%d%d",&N,&Q); for(int i=1; i<=N; i++) { scanf("%d",&X[i]); pq.push(X[i]); } while(Q--) { int S, T, P; scanf("%d%d%d",&S,&T,&P); pq.push(P); printf("%d\n", pq.top()); pq.pop(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 116 ms | 3780 KB | Output is correct |
2 | Correct | 91 ms | 6724 KB | Output is correct |
3 | Correct | 57 ms | 4740 KB | Output is correct |
4 | Correct | 110 ms | 8256 KB | Output is correct |
5 | Correct | 92 ms | 8156 KB | Output is correct |
6 | Correct | 95 ms | 8156 KB | Output is correct |
7 | Correct | 95 ms | 8232 KB | Output is correct |
8 | Correct | 92 ms | 8256 KB | Output is correct |
9 | Correct | 52 ms | 4712 KB | Output is correct |
10 | Correct | 81 ms | 6776 KB | Output is correct |
11 | Correct | 53 ms | 4708 KB | Output is correct |
12 | Correct | 82 ms | 6768 KB | Output is correct |
13 | Correct | 112 ms | 8076 KB | Output is correct |
14 | Correct | 94 ms | 6760 KB | Output is correct |
15 | Correct | 56 ms | 4660 KB | Output is correct |
16 | Correct | 114 ms | 8252 KB | Output is correct |
17 | Correct | 92 ms | 8212 KB | Output is correct |
18 | Correct | 97 ms | 8232 KB | Output is correct |
19 | Correct | 95 ms | 8168 KB | Output is correct |
20 | Correct | 94 ms | 8228 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |