Submission #1347305

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int main()
{
	set<pair<int,int>> mp;
	mp.insert({1,399});
        mp.insert({400,799});
	mp.insert({800,1199});
	mp.insert({1200,1599});
	mp.insert({1600,1999});
	mp.insert({2000,2399});
	mp.insert({2400,2799});
	mp.insert({2800,3199});
	int n,mi=0,ma=0;
	cin >> n;
	set<pair<int,int>> taken;
	int a[n];
	for(int i=0;i<n;++i)
	{
		cin>>a[i];
		for(auto k=mp.begin();k!=mp.end();++k){
			if(a[i]>=k->first&&a[i]<=k->second && taken.find(make_pair(k->first,k->second))==taken.end())
			{
				//cout<<a[i]<<" inserted\n";
				taken.insert(make_pair(k->first,k->second));
				++mi;
				++ma;
			}
		}
		if(a[i]>3199)
		{
			if(mi>0)
				++ma;
			else
			{
				++mi;
				++ma;
 
			}
		}
 
	}
	cout<<mi<<" "<<ma<<endl;
	return 0;
}

Submission Info

Judge Result