from heapq import *


#class job:
#  def __init__(self, start, end, cpu_load):
#    self.start = start
#    self.end = end
#    self.cpuLoad = cpu_load

# You can override/modify __lt__ as per your need
#setattr(Job, "__lt__", lambda self, other: write logic here)

class Solution:
  def findMaxCPULoad(self, jobs):
    max_cpu_load = 0

    sum = 0 
    
    jobs.sort(key=lambda x: x.start)

    def overlap(a, b):
      return b.start < a.end

    for i in range(len(jobs)):
      
      if i == 0 or not overlap(jobs[i-1], jobs[i]):
        sum = jobs[i].cpuLoad
      else:
        sum += jobs[i].cpuLoad

      max_cpu_load = max(max_cpu_load, sum)
      
    return max_cpu_load