Submission #676042

#	Time	Username	Problem	Language	Result	Execution time	Memory
676042		sudheerays123	Untitled (POI11_tem)	C++17	32 / 100	694 ms	54636 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll int
const ll N = 100+5 , INF = 1e9 , MOD = 1e9+7;

void solve(){

	ll n;
	cin >> n;

	vector<ll> a(n+5),b(n+5);
	for(ll i = 1; i <= n; i++) cin >> a[i] >> b[i];

	ll ans = 1;

	ll left = 1, right = 1;
	multiset<ll> s;

	while(left <= n){

		while(right <= n){

			auto it = s.end();
			if(s.size()) it--;
			if(!s.size() || (*(it)) <= b[right]){
				s.insert(a[right]);
				right++;
			}
			else break;
		}

		ll x = s.size();
		ans = max(ans,x);

		s.erase(s.find(a[left]));
		left++;
	}

	cout << ans;
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9