代码很简单，用了蛮久的 https://blog.csdn.net/csyifanZhang/article/details/106060687 ↑完整题解   int main() { ll n, p; string s; while (cin >> n >> s >> p) { string t = s, res; sort(t.begin(), t.end()); p = t.find(s[p - 1]);//p-1号是相同元素中最靠前的 whil...