Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- enter code here
- #include<bits/stdc++.h>
- using namespace std;
- struct con
- {
- string str;
- int len;
- int ind;
- };
- bool comp(con a,con b)
- {
- if(a.len<=b.len)
- {
- if(a.len==b.len)
- return a.str<b.str;
- return true;
- }
- //return true;
- return false;
- }
- int main()
- {
- int t;
- cin>>t;
- while(t--)
- {
- int n;
- cin>>n;
- int arr[n];
- for(int i=0;i<n;i++)
- cin>>arr[i];
- int k;
- cin>>k;
- int s=n/k;
- if(n%k!=0)
- s=s+1;
- vector<int>b[s];
- int m=-1;
- for(int i=0;i<n;i++)
- {
- if(i%k==0)
- m++;
- b[m].push_back(arr[i]);
- }
- con st[s];
- for(int i=0;i<s;i++)
- {
- string str="";
- for(int j=0;j<b[i].size();j++)
- {
- str+=to_string(b[i][j]);
- }
- st[i].str=str;
- st[i].len=str.length();
- st[i].ind=i;
- }
- sort(st,st+s,comp);
- for(int i=0;i<s;i++)
- {
- m=st[i].ind;
- for(int j=0;j<b[m].size();j++)
- cout<<b[m][j]<<" ";
- }
- cout<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement