Submission

Status:

[P][P][P][P][P][PPPPPPPP]

Subtask/Task Score:

{17/17}{17/17}{17/17}{17/17}{17/17}{17/17}

Score: 100

User: VggT

Problemset: ขายรถยนต์

Language: cpp

Time: 0.084 second

Submitted On: 2025-10-17 23:03:06

#include <bits/stdc++.h>
using namespace std;
int main()
{
	unsigned long long n, count = 0;
	cin >> n;
	vector<unsigned long long> vec(n);
	
	int nmax;
	
	for(int i = 0; i < n; i++)
	{
		int num1,num2;
		cin >> num1 >> num2;
		vec[i] = num2;
	}
	
	for(int i = n-1; i >= 0; i--)
	{
		if(i == n-1)
		{
			nmax = vec[i];
			continue;
		}
		
		if(nmax > vec[i])
		{
			count+=1;
		}
		else 
		{
			nmax = vec[i];
		}
	}
	
	
	
	cout << count;
	
	return 0;
}