ducalpha

#!/usr/bin/python

import time
start = time.time()

import os, sys
   
def setWindow(posX, posY, sizeX, sizeY):
    values = {        
        'gravity': 0,

ducalpha

/*You are given large numbers of logs, each one of which contains a start time (long), end time (long) and memory usage (int). The time is recorded as MMDDHH (100317 means October 3rd 5PM) Write an algorithm that returns a specific time (hour) when the memory usage is the highest. If there are multiple answers, return the first hour.
*/
#include <cstdio>
#include <sstream>
#include <fstream>
#include <map>
#include <vector>

using namespace std;