#include<bits/stdc++.h>
using namespace std;
 
int main() {
    vector<int> arr = {1,1,1,1,2};
    int k = 3;
    int minlen = INT_MAX;
 
    for(int i = 0; i < arr.size(); i++) {
        int sum = 0;
        for(int j = i; j < arr.size(); j++) {
            sum += arr[j];
            if(sum == k) {
                minlen = min(minlen, j - i + 1);
                break;  
            }
        }
    }
 
    if(minlen == INT_MAX)
        cout << "No subarray found";
    else
        cout << minlen;
 
    return 0;
}
 

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgdmVjdG9yPGludD4gYXJyID0gezEsMSwxLDEsMn07CiAgICBpbnQgayA9IDM7CiAgICBpbnQgbWlubGVuID0gSU5UX01BWDsKCiAgICBmb3IoaW50IGkgPSAwOyBpIDwgYXJyLnNpemUoKTsgaSsrKSB7CiAgICAgICAgaW50IHN1bSA9IDA7CiAgICAgICAgZm9yKGludCBqID0gaTsgaiA8IGFyci5zaXplKCk7IGorKykgewogICAgICAgICAgICBzdW0gKz0gYXJyW2pdOwogICAgICAgICAgICBpZihzdW0gPT0gaykgewogICAgICAgICAgICAgICAgbWlubGVuID0gbWluKG1pbmxlbiwgaiAtIGkgKyAxKTsKICAgICAgICAgICAgICAgIGJyZWFrOyAgCiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CgogICAgaWYobWlubGVuID09IElOVF9NQVgpCiAgICAgICAgY291dCA8PCAiTm8gc3ViYXJyYXkgZm91bmQiOwogICAgZWxzZQogICAgICAgIGNvdXQgPDwgbWlubGVuOwoKICAgIHJldHVybiAwOwp9Cg==