알고리즘/그리디 알고리즘

[백준] 1449 - 수리공 항승

TIM_0529 2023. 2. 10. 16:09
반응형
반응형
//#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#define _CRT_SECURE_NO_WARNINGS
using namespace std;

int main()
{
	int n, l, s, count = 0;
	bool cover = false;
	vector <int> leak;
	cin >> n >> l;
	for (int i = 0; i < n; i++)
	{
		int a;
		cin >> a;
		leak.emplace_back(a);
	}
	if (l == 1)
	{
		cout << n;
		return 0;
	}
	if (l == 0)
	{
		return 0;
	}
	sort(leak.begin(), leak.end());
	s = leak[0];
	for (int i = 1; i < n; i++)
	{
		if (leak[i] - s >= l)
		{
			count++;
			s = leak[i];
		}

	}
	

	cout << count;
}
반응형