sicily 1193 Up the Stairs

 1 //sicily 1193 Up the Stairs
 2 #include <bits/stdc++.h>
 3 
 4 using namespace std;
 5 
 6 int a[1005];
 7 
 8 int main()
 9 {
10     int t;
11     cin >> t;
12     while(t--)
13     {
14         int ans;
15         int n, f, b;
16         cin >> n >> f >> b;
17         int floor, box;
18         for(int i=0; i<n; i++)
19         {
20             cin >> floor >> box;
21             if(box)
22                 a[i] = 3 * f - floor;
23             else
24                 a[i] = f + floor;
25         }
26         sort(a, a+n);
27         int last = b % n;
28         if(last == 0)
29             ans = (b/n-1)*2*f+a[n-1];
30         else
31             ans = (b-1)/n*2*f+a[last-1];
32         cout << ans << endl;
33     }
34     return 0;
35 }