set的tj和不是set的tj

set的tj

#include <set>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main(){
    set <long long> s;
    int n ;
    scanf("%d", &n);  
    for(int i = 1 ;i <= n; i++){
        int x;
        scanf("%d", &x);
        s.insert(x);
    }
    printf("%d\n",s.size());
    for(auto i : s){
        cout<<i<<" ";
    }
    return 0;//养成好习惯
}

这是没有set的 tj

#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int n;
int maxx;
const int NN = 1e3 + 5;
vector <long long> a(NN);
int main(){
    scanf("%d", &n);
    for(int i = 1;i <= n; i++){
        int x;
        scanf("%d", &x);
        a[x] = 1;   
        maxx = max(maxx , x);
    }
    int cnt = 0;
    for(int i = 1;i <= maxx; i++){
        if(a[i] == 1) cnt++;
    }
    printf("%d\n", cnt );
    for(int i = 1;i <= maxx; i++){
        if(a[i] == 1) printf("%d ", i);
    }
    return 0;//养成好习惯 
}