题解 | #明明的随机数#

#include <iostream>
using namespace std;
#include <array>
#include <unordered_map>
#include <algorithm>

int input(int& n, std::array<int, 1000>& myArray) {
   cin >> n;
   std::unordered_map<int, bool> Map;
   int newSize = 0;
 
   for (int i = 0; i < n; i++){
      cin >> myArray[i];
       if (myArray[i] <= 500 && Map.find(myArray[i]) == Map.end()) {
            Map[myArray[i]] = true;
            myArray[newSize] = myArray[i];
            newSize++;
        }
   }
   return newSize;
}


int main() {
    int n;
    std::array<int, 1000> myArray{};
    int newSize = input(n, myArray);
    std::sort(myArray.begin(), myArray.begin() + newSize);
    for (int i = 0; i < newSize; i++){
        cout << myArray[i] << endl;
    }

    return 0;
    }