Submission #1793492

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;

int main() {
	// your code goes here
	int n, cnt=1, ave, sum; cin >> n;
	vector<int> v(n);

	for(int i=0; i<n; i++) {
		cin >> v[i];
	}
	
	sort(v.begin(), v.end());
	
	int m=v[0];
	
	for(int i=0; i<n-1; i++) {
		if(abs(m-v[i]) <= 2 || v[i] == m) cnt++;
		else {
			m = v[i];
			cnt=1;
		}
	}
	
	cout << cnt << endl;
	
	return 0;
}

Submission Info

Judge Result