1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
typedef long long ll;
9
const int maxn = 1e5 + 17;
10

11
ll t, x, n, a[maxn];
12
ll ans1, ans2;
13

14
int main() {
15
  cin >> t;
16
  while(t--) {
17
    cin >> n >> x;
18
    ans1 = 0, ans2 = 0;
19
    for(int i = 1; i <= n; i++) cin >> a[i];
20
    for(int i = 1; i <= n; i++) ans1 += a[i], ans2 += (a[i] / x + ((a[i] % x) ? 1 : 0));
21
    ans1 = (ans1 / x + ((ans1 % x) ? 1 : 0));
22
    cout << ans1 << " " << ans2 << endl;
23
  }
24
  return 0;
25
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
typedef long long ll;
9
const int maxn = 1e5 + 17;
10
const int oo = 0x3f3f3f3f;
11

12
int n, t, x, a[maxn], b[maxn], mb, p;
13
ll s[maxn];
14

15
int main() {
16
  cin >> t;
17
  while(t--) {
18
    cin >> n >> x;
19
    for(int i = 1; i <= n; i++) cin >> a[i];
20
    mb = oo, p = 0;
21
    for(int i = 1; i <= n; i++) {
22
      b[i] = 0;
23
      for(int t = a[i]; t % x == 0; t /= x) b[i]++;
24
      mb = min(mb, b[i]);
25
      s[i] = s[i - 1] + 1ll * a[i];
26
    }
27
    for(int i = 1; i <= n; i++) {
28
      if(b[i] == mb) {
29
        p = i - 1;
30
        break;
31
      }
32
    }
33

34
    cout << 1ll * (mb + 1) * s[n] + s[p] << endl;
35

36
  }
37
  return 0;
38
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
const int maxn = 3e5 + 17;
9

10
int n, t, m, k[maxn], c[maxn];
11
long long ans;
12

13
bool cmp(int x, int y) {
14
  return x > y;
15
}
16

17
int main() {
18
  scanf("%d", &t);
19
  while(t--) {
20
    scanf("%d%d", &n, &m);
21
    for(int i = 1; i <= n; i++) scanf("%d", &k[i]);
22
    for(int i = 1; i <= m; i++) scanf("%d", &c[i]);
23
    sort(k + 1, k + 1 + n, cmp);
24
    for(int i = 1; i <= m; i++) {
25
      if(k[i] > i) k[i] = i;
26
      else break;
27
    }
28
    for(int i = 1; i <= n; i++) ans += 1ll * c[k[i]];
29
    printf("%lld\n", ans);
30

31
    ans = 0;
32
    for(int i = 1; i <= n; i++) k[i] = 0;
33
    for(int i = 1; i <= m; i++) c[i] = 0;
34
  }
35
  return 0;
36
}