C ++ implementation of shortest job first using the concept of segment tree
#include <bits/stdc++.h> NEW_LINE using namespace std ; #define ll  long long NEW_LINE #define z  1000000007 NEW_LINE #define sh  100000 NEW_LINE #define pb  push_back NEW_LINE #define pr ( x )  printf("%d ", x) NEW_LINE struct util {