# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
100904 | 2019-03-15T04:35:03 Z | autumn_eel | Sushi (JOI16_sushi) | C++14 | 112 ms | 6884 KB |
#include <bits/stdc++.h> #define rep(i,n)for(int i=0;i<(n);i++) using namespace std; typedef long long ll; typedef pair<int,int>P; int main(){ int n,q;cin>>n>>q; priority_queue<int>que; rep(i,n){ int x;scanf("%d",&x); que.push(x); } rep(i,q){ int s,t,p;scanf("%d%d%d",&s,&t,&p); que.push(p); printf("%d\n",que.top()); que.pop(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 94 ms | 6592 KB | Output is correct |
2 | Correct | 99 ms | 5216 KB | Output is correct |
3 | Correct | 51 ms | 3308 KB | Output is correct |
4 | Correct | 93 ms | 6884 KB | Output is correct |
5 | Correct | 97 ms | 6628 KB | Output is correct |
6 | Correct | 98 ms | 6632 KB | Output is correct |
7 | Correct | 112 ms | 6812 KB | Output is correct |
8 | Correct | 112 ms | 6600 KB | Output is correct |
9 | Correct | 51 ms | 3312 KB | Output is correct |
10 | Correct | 89 ms | 5220 KB | Output is correct |
11 | Correct | 56 ms | 3308 KB | Output is correct |
12 | Correct | 84 ms | 5220 KB | Output is correct |
13 | Correct | 111 ms | 6500 KB | Output is correct |
14 | Correct | 84 ms | 5192 KB | Output is correct |
15 | Correct | 57 ms | 3272 KB | Output is correct |
16 | Correct | 102 ms | 6628 KB | Output is correct |
17 | Correct | 77 ms | 6628 KB | Output is correct |
18 | Correct | 86 ms | 6628 KB | Output is correct |
19 | Correct | 89 ms | 6572 KB | Output is correct |
20 | Correct | 95 ms | 6616 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |