/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 484.0 KiB
#2 Accepted 3ms 576.0 KiB
#3 Accepted 3ms 600.0 KiB
#4 Accepted 3ms 532.0 KiB
#5 Accepted 3ms 532.0 KiB
#6 Accepted 3ms 532.0 KiB
#7 Accepted 3ms 628.0 KiB
#8 Accepted 2ms 536.0 KiB
#9 Accepted 2ms 532.0 KiB
#10 Accepted 3ms 532.0 KiB
#11 Accepted 2ms 324.0 KiB
#12 Accepted 2ms 576.0 KiB
#13 Accepted 3ms 576.0 KiB
#14 Accepted 3ms 576.0 KiB
#15 Accepted 3ms 576.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;

#define print(a) for(auto x:a)cout<<x<<' ';cout<<'\n';
#define debug(x) cout<<#x<<" "<<x<<'\n'
#define int   long long int

const int M = 1e9 + 7;
const int N = 2e5 + 10;

void solve(){
   int n, k;
   cin >> n >> k;

   vector<string> a(n);
   for(int i = 0; i < n; i++){
      int x; cin >> x;
      a[i] = to_string(x);
   }

   string res;
   
   for(int i = max(0ll, n - k - 1); i >= 0; i--){
      string s = "";
      for(int j = i, cnt = k + 1; j < n && cnt--; j++){
         s += a[j];
      }
      if(res.size() < s.size()) res = s;
      else if(s.size() == res.size()) res = max(res, s);
   }
   cout << res << '\n';

}

signed main() {
   ios_base::sync_with_stdio (0);
   cin.tie (0);

   int t = 1;   cin >> t;
   for (int tc = 1; tc <= t; tc++) {
      //cout<<"Case "<<tc<<": ";
      solve();
   }
   return 0;
}

Information

Submit By
Type
Submission
Problem
P1083 Number concatenation
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 15:52:10
Judged At
2024-10-03 13:29:39
Judged By
Score
100
Total Time
3ms
Peak Memory
628.0 KiB