# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231282 | origami100 | Baloni (COCI15_baloni) | C++11 | 292 ms | 2552 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;
int main(){
ll n;
cin >> n;
multiset <ll> num;
for(ll i = 0; i < n; i++){
ll a;
cin >> a;
if(num.empty()){
num.insert(a);
}else{
multiset <ll>::iterator it;
it = num.lower_bound(a + 1);
if(it == num.end()){
num.insert(a);
}else if(*it == a + 1){
num.erase(it);
num.insert(a);
}
}
}
cout << num.size();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |