Submission #6945145

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <climits>
#include <map>
#include <set>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;


int main()
{
    int n;cin >> n;
    string s;
    cin >> s;
    int one = 0,two = 0,three = 0,four = 0;
    for(int i = 0; i < n; i++){
        if(s[i] == '1')one++;
        else if(s[i] == '2') two++;
        else if(s[i] == '3') three++;
        else four++;
    }
    cout << max({one,two,three,four}) << ' ' << min({one,two,three,four}) << endl;
}

Submission Info

Judge Result