Submission #467126

#	Time	Username	Problem	Language	Result	Execution time	Memory
467126		ritul_kr_singh	Money (IZhO17_money)	C++17	0 / 100	1 ms	204 KiB

money

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

const int MAX_N = 1e6+1;

int N, A[MAX_N], ans;
multiset<int> s;

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	
	cin >> N;

	for(int i=0; i<N; ++i) cin >> A[i];

	for(int i=0, j; i<N; i=j){
		j = i + 1;
		s.insert(A[i]);

		while(j < N && A[j-1] <= A[j]){
			auto f = s.upper_bound(A[j-1]);
			if(f == end(s) || A[j] <= *f)
				s.insert(A[j++]);
			else break;
		}

		++ans;
	}

	cout << ans;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55