# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671603 | 2022-12-13T09:22:26 Z | smartmonky | Money (IZhO17_money) | C++14 | 0 ms | 212 KB |
#include <bits/stdc++.h> #define ff first #define ss second #define pb push_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define int long long using namespace std; const int N = 500001; int f[N],s[N], pos[N]; int n; main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; multiset <int> st; vector <int> v(n + 1); int ans = 1; st.insert(1e9); for(int i = 1; i <= n; i++){ cin >> v[i]; } st.insert(v[1]); for(int i = 2; i <= n; i++){ auto it = st.upper_bound(v[i - 1]); auto k = st.lower_bound(v[i - 1]); if(*it == 1e9 || *it >= v[i]){ st.insert(v[i]); continue; }else{ st.insert(v[i]); ans++; } } cout << ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |