1 条题解

  • 0
    @ 2026-8-20 11:36:56

    #include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector a(n); for (int &x : a) cin >> x; int highest = a[0], lowest = a[0], countHighest = 0; for (int x : a) { highest = max(highest, x); lowest = min(lowest, x); } for (int x : a) if (x == highest) countHighest++; cout << highest << ' ' << lowest << ' ' << countHighest << '\n'; }

    • 1

    信息

    ID
    393
    时间
    1000ms
    内存
    256MiB
    难度
    1
    标签
    递交数
    0
    已通过
    0
    上传者