# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713840 | ALTAKEXE | Baloni (COCI15_baloni) | C++14 | 339 ms | 4336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6 + 11;
int main() {
//freopen("input.txt","r",stdin);
ll n; cin >> n;
int a[N];
for (int i = 1;i <= n;i++) cin >> a[i];
ll ans = 0;
multiset<ll> st;
for (int i = 1;i <= n;i++) {
auto to = st.find(a[i] + 1);
if (to == st.end()) {
ans++;
} else {
st.erase(to);
}
st.insert(a[i]);
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |