Optimization on Sieve of Eratosthenes using vector
Repeating work already done
The biggest problem with your solution is that for each test case, you start over from scratch.  This causes you to do up to 10x the work that you need to do.  What you should do instead is:

Read all test cases first (into a vector for example).
Find the maximum n of all the test cases.
Use your sieve once to find all primes up to the maximum number.
Using the vector of primes that you produced with the sieve, solve all test cases.

Don't use expensive operations in loop iterator
Depending on your compiler, this line could be costly:

    for (ll i = 2; i &lt;= sqrt(n); ++i) {


You could instead do:
     for (ll i = 2, sqrt_n = sqrt(n); i &lt;= sqrt_n; ++i) {

to make sure that you don't call sqrt() once per loop iteration.
Sieve loop improvements
This sieve loop:

            for (ll j = 2; (i*j) &lt;= n; ++j) {
                primes[i*j] = 1;
            }


Could be written more optimally as:
            for (ll j = i*i, dj = i+i; j &lt;= n; j += dj) {
                primes[j] = 1;
            }

Notice, the loop starts at i*i instead of 2*i, and it iterates by 2*i instead of by i.  It also avoids multiplication within the main loop.  However, this loop assumes that all even numbers have already been marked from the primes array, so you will have to do that separately when you create the primes array.
Printing loop
The printing loop is not optimal because it starts at 2, even though first may be very large:

    for (ll i = 2; i &lt;= n; ++i) {
        if (primes[i] == 0 &amp;&amp; i &gt;= first) {
            cout &lt;&lt; i &lt;&lt; '\n';
        }
    }


You should just start the loop at first:
    for (ll i = first; i &lt;= n; ++i) {
        if (primes[i] == 0) {
            cout &lt;&lt; i &lt;&lt; '\n';
        }
    }