pq_sort.cpp

#include <queue>
#include <iostream>

using namespace std;

struct paper {
	int idx;
	int importance;
	paper(int idx = 0, int importance = 0):
		idx(idx), importance(importance) {
	}
};

bool operator<(const paper& u, const paper& v) {
	if (u.importance == v.importance) {
		return u.idx < v.idx;
	}
	return u.importance < v.importance;
}

int main(void) {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int tc;
	cin >> tc;
	while (tc--) {
		int n, m;
		cin >> n >> m;
		priority_queue<paper> pq;
		for (int i = 0; i < n; i++) {
			int imp;
			cin >> imp;
			pq.push(paper(i, imp));
		}
		
		int ans = 1;
		while (!pq.empty()) {
			if (pq.top().idx == m) {
				break;
			}
			pq.pop();
			ans += 1;
		}

		cout << ans << '\n';
	}

	return 0;
}