Submission #1971770

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;
typedef long long ll;
const ll INF=100000000000000LL;

int main() {
	int n,a[101];
	int b[9]={};
	cin>>n;
	for(int i=0;i<n;++i){
		cin>>a[i];
		if(a[i]<400)b[0]++;
		else if(a[i]<800)b[1]++;
		else if(a[i]<1200)b[2]++;
		else if(a[i]<1600)b[3]++;
		else if(a[i]<2000)b[4]++;
		else if(a[i]<2400)b[5]++;
		else if(a[i]<2800)b[6]++;
		else if(a[i]<3200)b[7]++;
		else b[8]++;
	}
	int r=0,f=0;
	bool d=false;
	for(int i=0;i<8;++i){
		if(b[i]){
			++r;
			d=true;
		}else f++;
	}
	if(!d&&b[8])cout<<1<<" "<<min(b[8],8)<<endl;
	else {
		if(f)cout<<r<<" "<<r+min(b[8],f)<<endl;
	}
	return 0;
}

Submission Info

Judge Result