4 条题解

  • 0
    @ 2023-2-2 12:24:04
    #include <iostream>
    #include <stack>
    #include <cmath>
    #include <vector>
    #include <string.h>
    #include <queue>
    #include <stdio.h>
    #include <iomanip>
    #include <cstdio>
    #include <algorithm>
    #define int long long
    using namespace std;
    const int N = 1e4 + 10;
    const int INF = 0x3f3f3f3f;
    int a[N];
    signed main()
    {
    	int n, maxx = -INF;
        cin >> n;
        for(int i = 1; i <= n; i++)
        {
            double x;
            cin >> x;
            x *= 100;
            int xx = x;
            a[xx]++;
            maxx = max(maxx, a[xx]);
        }
        //cout << maxx << endl;
        for(int i= 1; i <= 10000; i++)
        {
            if(a[i] == maxx)
            {
                //一种奇怪的东西
                int len1, len2;
                len1 = i / 100;
                len2 = i % 100;
                cout << len1 << "." << len2 << " " << maxx << endl;
                //一种奇怪的东西
            }
        }
    	return 0;
    }
    

    信息

    ID
    999
    时间
    1000ms
    内存
    128MiB
    难度
    5
    标签
    递交数
    331
    已通过
    129
    上传者