POJ 2388 排序

//无聊玩玩vector"一等公民"#include<iostream>#include<vector>#include <algorithm>using namespace std;int main(){    int i, N;    cin >> N;    vector<int>arr(N);    for (i = 0; i < N; i++)        cin >> arr[i];    sort(arr.begin(), arr.end());    cout << arr[N / 2] << endl;    return 0;}

开始RE的代码：

#include <iostream>#include <algorithm>using namespace std;int a[1005];int main(){    int N;    cin>>N;    for(int i=0;i<N;i++)    {        cin>>a[i];    }    sort(a,a+N);    cout<<a[((1+N)/2)-1]<<endl;    return 0;}

改了一下就过了

#include <iostream>#include <algorithm>using namespace std;int a[10005];int main(){    int N;    cin>>N;    for(int i=0;i<N;i++)    {        cin>>a[i];    }    sort(a,a+N);    int ans=(1+N)/2-1;    cout<<a[ans]<<endl;    return 0;}