Blue Bridge Cup ALGO-111 random number (sort, go weight)

"Idea": vector perfect solution. Notice the dynamic array of vectors, or else 0.

"AC Code":

#include <iostream> #include <algorithm> #include <vector> #include <cstdio> #include < cstring>using namespace std; #define MAX 100+5int cmp (int a, int b) {return a < b;}  int main () {//freopen ("In.txt", "R", stdin), int n = 0, i = 0;//inputcin >> n;vector<int> A (n);vector<int> :: Iterator iter;for (i = 0; i < n; i++) cin >> A[i];//sortsort (A.begin (), A.end (), CMP);//deletefor (Iter = a.be Gin (+1); Iter! = A.end (); {int c = (*iter), d = (* (Iter-1)), if ((*iter) = = (* (Iter-1))) Iter = A.erase (iter); elseiter++;} Outputcout << a.size () << endl;for (Iter = A.begin (); Iter! = A.end (); iter++) cout << (*iter) << ""; return 0;}

Blue Bridge Cup ALGO-111 random number (sort, go weight)