#include <iostream> #include <vector> #include <algorithm> using namespace std; int MED(vector<int>data) { int med = -1; sort(data.begin(), data.end()); unsigned long size = data.size(); if (size%2 == 1){ med = data.at(size/2 ); } else { med = data.at(size/2 ); } return med; } int process(vector<int>data,int r) { unsigned long n = data.size(); vector<int> tmp; while (r++ <=n) { for (int i = 0 ; i < n; i ++) { for (int j = 0 ; j < r; j ++) { tmp.push_back(data.at((i + j)%n)); } *(data.begin() + i) = MED(tmp); tmp.clear(); } } sort(data.begin(), data.end()); if (data.at(0) == data.at(n-1)) { return data.at(0); } else return 0; } int main(int argc, const char * argv[]) { int n; int r; int value; int i = 0; vector<int> data; cin>>n; cin>>r; while (i++ < n) { cin>>value; data.push_back(value); } cout<<process(data, r); data.clear(); return 0; } 通过率20%不知道怎么改了