When the sum crosses a threshold

You are given a natural number $n$. Find the smallest natural $k$ such that $1 + 2 + \ldots + k \ge n$. Print $k$ and the sum at that moment.

A single integer $n$ ($1 \le n \le 10^{12}$).

A single line with two integers: $k$ and $1 + 2 + \ldots + k$.

The number of steps is not known in advance — use a while loop: while the sum is less than $n$, add the next number. In the first example $1 + 2 + 3 + 4 = 10 \ge 10$, so the answer is 4 10; in the second $k = 5$ and the sum is $15$.

The sum exceeds $10^{12}$ — you need long long / int64.