Class Template for Dynamic Array and Linear Search

#include <iostream>
#include <cstdlib>

using namespace std;

template <class T, int size = 0>
class Array{
    T *arr;
    int length;
    public:
        Array();
        ~Array();
        Array(int);
        void input();
        void linearSearch(T);
};

template <class T, int size>
inline Array<T, size>::Array(){
    length = size;
    arr = new T[length];
}

template <class T, int size>
inline Array<T, size>::~Array(){
    delete[] arr;
}

template <class T, int size>
inline Array<T, size>::Array(int length){
    arr = new T[Array::length = length];
}

template <class T, int size>
inline void Array<T, size>::input(){
    for(int i = 0; i < length; i++){
        cout << "arr[" << i << "] = ";
        cin >> arr[i];
    }
}

template <class T, int size>
inline void Array<T, size>::linearSearch(T key){
    for(int i = 0; i < length; i++){
        if(arr[i] == key){
            cout << key << " found at " << i << " position\n" ;
        }
    }
}

int main() {
    system("cls");
    cout << "For integer array" << endl;
    Array<int, 5> obj1;
    obj1.input();
    cout << "Enter an element to be searched: ";
    int key1;
    cin >> key1;
    obj1.linearSearch(key1);

    cout << "For double array" << endl;
    Array<float> obj2(5);
    obj2.input();
    cout << "Enter an element to be searched: ";
    float key2;
    cin >> key2;
    obj2.linearSearch(key2);
    return 0;
}