How finding a map triplet pair with one element for example (4,(?,?)) so i know that int 4 -> how can i find it because i get so much error and four hours of searching for possible solution to filter the coordinates with that key.

```
int k = *min_element(min1.begin(), min1.end());
auto it = myninja.begin();
it = find(myninja.begin(), myninja.end(), k);
for (it = myninja.begin(); it != myninja.end(); it++) {
p.row= (it->second).first;
p.col = (it->second).second;
}
```

these are my declarations

```
vector <pair<int, pair<int, int> > > myninja;
vector <int> min1;
```

and this is where i want to put out my min for A* -> f value for minimum range to goal

```
int k = *min_element(min1.begin(), min1.end());
```

to keep the actual value from this i want to update the start point with the minimum of f -> so i want to give the point (x,y) so i thought

```
vector <pair<int, pair<int, int> > > myninja;
```

would be the best, but always i want to find out from which f(n) value it comes from -> error in iterator/loop or it displays me errorcode

i think i comes from the find function because maybe he can't handle a int k (which i want to search my points)

(F-Value,(x-coordinate,y-coordinate)

also this is not working

```
int k = *min_element(min1.begin(), min1.end());
auto result = std::find_if(myninja.begin(),myninja.end(),[k](const auto& mo){return mo.second == val; });
//RETURN VARIABLE IF FOUND
if (result != myninja.end())
int foundkey = (result->second).first;
```