Language: C++

#include<iostream>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<bitset>
#include <climits>
using namespace std;
#define _GLIBCXX_DEBUG
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define vit vector<lint>::iterator
#define all(x) (x).begin(),(x).end()
#define rep(x) for(int i = 0;i < (x);i++)
#define repj(x) for(int j = 0;j < (x);j++)
#define REP(i,x) for(int (i) = 0;(i) < (x);(i)++)
#define rrep(x) for(int i = (x);i >= 0;i--)
#define mins(x,y) x = min(x,y)
#define maxs(x,y) x = max(x,y)
#define mod 1000000007
#define graph_set(n) struct edge{int to,int cost;} vector<edge> G((n))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define range(x,y) ((x) >= 0 && (x) < h && (y) >= 0 && (y) < w)
#define pyes cout << "Yes" << endl
#define pno cout << "No" << endl
#define fin return 0
typedef vector<long long> vi;
typedef vector<pair<long long, long long>> vp;
typedef vector<vector<long long>> vvi;
typedef pair<long long, long long> pi;
typedef long long lint;
typedef long long ll;
lint qp(ll a, ll b) { ll ans = 1; do { if (b & 1)ans = 1ll * ans*a; a = 1ll * a*a; } while (b >>= 1); return ans; }
lint qp(ll a, ll b, int mo) { int ans = 1; do { if (b & 1)ans = 1ll * ans*a%mo; a = 1ll * a*a%mo; } while (b >>= 1); return ans; }
lint gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
long long INF = 1e19;

int r[100], l[100];
int a, b;

#define MAX 9223372036854775807
//////////////////////////////////////////////////////////////////////

int main() {
	int n; cin >> n;
	priority_queue<int, vector<int>, greater<int> > q;
	priority_queue<int>　d;
	int res = 1;
	rep(n) {
		if (i == 0) {
			int x; cin >> x;
			q.push(x);
			d.push(x);
		}
		else {
			int x; cin >> x;
			if(!q.empty()){
    			if(x > d.top()){
    			    d.pop();
    			    d.push(x);
    			    q.push(x);
    			}else if(x <= q.top()){
    			    res++;
    			    q.pop();
    			    q.push(x);
    			}
    			continue;
			}
			if(x > d.top()){
			    d.pop();
			    d.push(x);
			}else{
			    res++;
			    d.push(x);
			    q.push(x);
			}
			/*if( x > q.top()){
			    q.pop();
			    q.push(x);
			}else{
			    res++;
			    q.push(x);
			}*/
		}
	}
	cout << res << endl;
	return 0;
}


Compiler output:
a.cc:56:28: error: extended character 　 is not valid in an identifier
   56 |         priority_queue<int>　d;
      |                            ^
a.cc:45:17: warning: overflow in conversion from 'double' to 'long long int' changes value from '1.0e+19' to '9223372036854775807' [-Woverflow]
   45 | long long INF = 1e19;
      |                 ^~~~
a.cc: In function 'int main()':
a.cc:62:25: error: 'd' was not declared in this scope
   62 |                         d.push(x);
      |                         ^
a.cc:67:32: error: 'd' was not declared in this scope
   67 |                         if(x > d.top()){
      |                                ^
a.cc:78:32: error: 'd' was not declared in this scope
   78 |                         if(x > d.top()){
      |                                ^