Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int arr[10000], ar[150];
- int main()
- {
- int len, b, km[150], k;
- string ch;
- while(cin>>ch){
- memset(arr, 0, 2000);
- memset(ar, 0, 2000);
- memset(km, 0, 2000);
- len=ch.size();
- int j=0;
- for(int i=0; i<len; i++){
- arr[ch[i]]++;
- b=ch[i];
- if(b!=ch[i+1]){
- ar[j]=b;
- j++;
- }
- }
- k=0;
- for(int i=0; i<128; i++){
- if(arr[i]!=0){
- km[k]=arr[i];
- k++;
- }
- }
- if(km[0]>km[1]){
- sort(km, k+km);
- sort(ar, j+ar, greater<int>());
- }
- j=0;
- for(int i=0; i<k; i++){
- cout<<ar[j]<<" ";
- cout<<km[i]<<endl;
- j++;
- }
- cout<<endl;
- }
- printf("\b");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement