# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
1105578 |
2024-10-26T19:24:40 Z |
Drew_ |
Po (COCI21_po) |
C++17 |
|
10 ms |
724 KB |
#include <bits/stdc++.h>
using namespace std;
#define f1 first
#define s2 second
using ll = long long;
using ii = pair<int, int>;
int main() {
ios :: sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
int Z = 0;
priority_queue<int> pq;
for (int i = 0, x; i < N; ++i) {
cin >> x;
while (!pq.empty() && pq.top() > x) pq.pop();
if (!pq.empty() && pq.top() == x) continue;
pq.push(x); Z += x > 0;
}
cout << Z << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
504 KB |
Output is correct |
4 |
Correct |
3 ms |
456 KB |
Output is correct |
5 |
Correct |
4 ms |
336 KB |
Output is correct |
6 |
Correct |
10 ms |
724 KB |
Output is correct |
7 |
Correct |
8 ms |
336 KB |
Output is correct |