http://120.78.162.102/problem.php?cid=1432&pid=12

http://120.78.162.102/problem.php?id=6251

題解：只有x或者x+1人？？？

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,q; struct node{int id,x;bool operator <(const node &S)const{if(x==S.x)return id<S.id;return x<S.x;} }a[N]; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endifwhile(scanf("%d%d%d",&n,&m,&k)!=EOF){for(int i=1;i<=n;i++){scanf("%d",&t);a[i].id=i;a[i].x=abs(t-m);}sort(a+1,a+n+1);int cnt=0;t=1;while(cnt<k){if(a[t].x!=0){//cnt++;q=a[t].x;while(q==a[t].x&&cnt<=k){cout << a[t].id << endl;t++;cnt++;}}else{t++;}}}//cout << "Hello world!" << endl;return 0; }

?

總結

以上是生活随笔為你收集整理的最亲密的x个人的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。