/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 2ms 480.0 KiB
#2 Accepted 14ms 956.0 KiB
#3 Accepted 16ms 764.0 KiB
#4 Accepted 15ms 796.0 KiB
#5 Accepted 16ms 840.0 KiB
#6 Accepted 16ms 796.0 KiB
#7 Accepted 16ms 844.0 KiB
#8 Accepted 19ms 956.0 KiB
#9 Accepted 22ms 956.0 KiB
#10 Accepted 25ms 948.0 KiB
#11 Accepted 26ms 1.176 MiB
#12 Accepted 26ms 1.184 MiB
#13 Accepted 26ms 1.18 MiB
#14 Accepted 26ms 960.0 KiB
#15 Accepted 27ms 1.184 MiB
#16 Wrong Answer 26ms 956.0 KiB

Code


#include <bits/stdc++.h>

#ifdef LOCAL
#include "../algo/debug.h"
#else 
#define debug(...) 0
#endif

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    sort(a.begin(), a.end());
    int m = k;
    for (int i = n - 1; i >= 0; i--) {
      while (i >= 0 && a[i] > m) {
        i--;
      }
      if (i < 0 || a[i] < m) {
        break;
      }
      m--;
    }
    if (m * 2 > a.back()) {
      cout << m << '\n';
      continue;
    }
    m = a.back() + 1;
    vector<long long> f(m);
    for (int i = 0; i < n; i++) {
      f[a[i]] += a[i];
    }
    long long ans = 1e18, w = 0;
    for (int i = 1; i <= k; i++) {
      long long now = 0;
      for (int j = i; j < m; j += i) {
        now += f[j];
      }
      if (now < ans) {
        ans = now;
        w = i;
      }
    }
    cout << w << '\n';
  }
  return 0;
}

Information

Submit By
Type
Submission
Problem
P1039 Prince Roy, the undisputed ruler of the world
Contest
Brain Booster #3
Language
C++20 (G++ 13.2.0)
Submit At
2024-05-06 15:54:25
Judged At
2024-11-11 03:33:41
Judged By
Score
70
Total Time
27ms
Peak Memory
1.184 MiB