Submission

PPPPPPPPPP

Score: 100

User: Him123

Problemset: ค่าผ่านทางรถบรรทุก

Language: cpp

Time: 0.004 second

Submitted On: 2025-03-23 09:11:30

#include <iostream>
using namespace std;

int main(){
	int N;
	int L;
	cin >> N >> L;
	
	int Si[2000], Ti[2000];
	
	for(int i = 0; i < N; i++){
		cin >> Si[i] >> Ti[i];
	}
	
	for (int i = 0; i < N - 1; i++){
		int minNum = i;
		for (int j = i + 1; j < N; j++){
			if (Ti[j] < Ti[minNum]){
				minNum = j;
			}
		}
		
		int SwapS = Si[i], SwapT = Ti[i];
		Si[i] = Si[minNum], Ti[i] = Ti[minNum];
		Si[minNum] = SwapS, Ti[minNum] = SwapT;
	}
	
	int toll_count = 0;
	int last_tollposition = -1;
	
	for (int i = 0; i < N; i++) {
		if (last_tollposition < Si[i]){
			last_tollposition = Ti[i];
			toll_count++;
		}
	}
	
	cout << toll_count << endl;
}