CSES - Increasing Array II

Time Complexity: $\mathcal O(N\log N)$

This problem is similar to CF 713C except that we're supposed to create a non-decreasing array.

Here is zscoder's tutorial.

Copy
#include <queue>
#include <stdio.h>
using namespace std;

int n, t;
long long ans = 0;
priority_queue<int> Q;

int main() {
	scanf("%d", &n);