// URL: https://yukicoder.me/problems/no/180 import std.algorithm, std.array, std.bitmanip, std.container, std.conv, std.format, std.functional, std.math, std.range, std.traits, std.typecons, std.stdio, std.string; version(unittest) {} else void main() { int N; io.getV(N); struct L { long a, b; } L[] l; io.getS!("a", "b")(N, l); l.sort!"a.b f(x+1)-f(x), "a<=b")(0).front); } pure nothrow @nogc @safe { auto lowerBoundBy(alias conv = "a", alias comp = "a tuple(e, convFun(e))).assumeSorted!((a, b) => compFun(a[1], b[1])); } } struct ConvexHullTrick(T, alias comp = "a>=b") { pure nothrow @safe { void add(T a, T b) { auto line = Line(a, b); while (lines.length >= 2 && check(lines[$-2], lines[$-1], line)) lines = lines[0..$-1]; lines ~= line; } T query(T x) { ptrdiff_t low = -1, high = cast(ptrdiff_t)lines.length-1; while (high-low > 1) { auto mid = (high+low)/2; (compFun(lines[mid].f(x), lines[mid+1].f(x)) ? low : high) = mid; } return lines[high].f(x); } } private { alias compFun = binaryFun!comp; struct Line { T a, b; auto opCmp(Line r) const { if (a < r.a) return -1; else if (a > r.a) return 1; if (b < r.b) return -1; else if (b > r.b) return 1; return 0; } auto f(T x) { return a*x+b; } } Line[] lines; pure nothrow @nogc @safe { bool check(Line l1, Line l2, Line l3) { if (l1 < l3) swap(l1, l3); return (l3.b-l2.b)*(l2.a-l1.a) >= (l2.b-l1.b)*(l3.a-l2.a); } } } } auto io = IO!()(); import std.stdio; struct IO(alias IN = stdin, alias OUT = stdout) { import std.meta : allSatisfy; import core.stdc.stdlib : exit; void getV(T...)(ref T v) { foreach (ref w; v) get(w); } void getA(T)(size_t n, ref T v) if (hasAssignableElements!T) { v = new T(n); foreach (ref w; v) get(w); } void getC(T...)(size_t n, ref T v) if (allSatisfy!(hasAssignableElements, T)) { foreach (ref w; v) w = new typeof(w)(n); foreach (i; 0..n) foreach (ref w; v) get(w[i]); } void getM(T)(size_t r, size_t c, ref T v) if (hasAssignableElements!T && hasAssignableElements!(ElementType!T)) { v = new T(r); foreach (ref w; v) getA(c, w); } template getS(E...) { void getS(T)(size_t n, ref T v) { v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");"); } } const struct PutConf { bool newline = true, flush, exit; string floatFormat = "%.10f", delimiter = " "; } void put(alias conf = "{}", T...)(T v) { mixin("const PutConf c = "~conf~"; putMain!c(v);"); } void putB(alias conf = "{}", S, T)(bool c, S t, T f) { if (c) put!conf(t); else put!conf(f); } void putRaw(T...)(T v) { OUT.write(v); OUT.writeln; } private { dchar[] buf; auto sp = (new dchar[](0)).splitter; void nextLine() { IN.readln(buf); sp = buf.splitter; } void get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); } void putMain(PutConf c, T...)(T v) { foreach (i, w; v) { putOne!c(w); if (i+1 < v.length) OUT.write(c.delimiter); } static if (c.newline) OUT.writeln; static if (c.flush) OUT.flush(); static if (c.exit) exit(0); } void putOne(PutConf c, T)(T v) { static if (isInputRange!T && !isSomeString!T) putRange!c(v); else static if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v)); else static if (hasMember!(T, "fprint")) v.fprint(OUT); else OUT.write(v); } void putRange(PutConf c, T)(T v) { auto w = v; while (!w.empty) { putOne!c(w.front); w.popFront(); if (!w.empty) OUT.write(c.delimiter); } } } }