File size: 2,309 Bytes
c4b0eef |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 |
/*************************************
******** Team : BUBT_HIDDEN **********
**************************************
*********** Shipu Ahamed *************
*************************************/
#include<algorithm>
#include<iostream>
#include<iterator>
#include<cassert>
#include<sstream>
#include<fstream>
#include<cstdlib>
#include<cstring>
#include<utility>
#include<complex>
#include<string>
#include<cctype>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<queue>
#include<cmath>
#include<deque>
#include<list>
#include<set>
#include<map>
#define sc scanf
#define pf printf
#define ll long long
#define pi 2*acos(0.0)
#define ff first
#define se second
#define inf (1<<30) //infinity value
#define pb push_back
#define mod 1000000007
#define ST(v) sort(v.begin(),v.end())
#define cover(a,d) memset(a,d,sizeof(a))
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
#define maxall(v) *max_element(v.begin(),v.end())
#define minall(v) *min_element(v.begin(),v.end())
#define un(v) ST(v), v.erase(unique(v.begin(),v.end()),v.end())
using namespace std;
ll gcd(ll a, ll b)
{
if (b==0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b)
{
return a/gcd(a, b)*b;
}
bool cmp(ll a,ll b)
{
return a > b;
}
int main()
{
// input;
// output;
string s;
int f=0;
while(getline(cin,s))
{
if(f)
pf("\n");
int l=s.size();
map<int,int>mp;
map<char,int>mp1;
priority_queue<int>pq;
for(int i=0;i<l;i++)
{
mp[s[i]]++;
}
for(int i=0;i<l;i++)
{
if(mp1[s[i]]==0){
pq.push(-mp[s[i]]);
mp1[s[i]]++;
}
}
while(!pq.empty())
{
map<int,int>:: iterator it;
int a=-pq.top();
for(it=mp.end();;it--)
{
if(a==it->se)
{
cout<<it->ff<<" "<<it->se<<endl;
it->se=0;
break;
}
}
pq.pop();
}
f=1;
}
return 0;
}
|