~~这道题的答案是无解~~~~~~
by heqicheng @ 2024-03-25 17:23:44
```cpp
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[1000001];
long long t;
bool cmp(long long x,long long y){
return x > y;
}
int main() {
scanf ("%d",&n);
for (int i = 1;i <= n;i++)
scanf ("%lld",&a[i]);
sort (a + 1,a + n + 1,cmp);
scanf ("%lld",&t);
long long sum = 1;
a[n + 1] = LLONG_MIN;
for (int i = 1;i <= n;i++){
if (a[i] == t)
break;
sum++;
}
printf ("%lld",sum);
}
```
by XYZcoder @ 2024-03-25 17:24:36
@[sunny_town](/user/1240580) ~~这道题的答案是无解~~~~~~
by heqicheng @ 2024-03-25 17:24:54
@[XYZcoder](/user/1298293) 我哪里错了
by sunny_town @ 2024-03-25 17:25:08
@[sunny_town](/user/1240580) 从大到小排
by wei2013 @ 2024-03-25 17:33:06
@[wei2013](/user/1060672) 求ac代码
by sunny_town @ 2024-03-25 17:47:37
@[sunny_town](/user/1240580) 在哪交？
by wei2013 @ 2024-03-25 18:01:40
```cpp
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[1000001];
long long t;
bool cmp(long long x,long long y){
return x > y;
}
int main() {
scanf ("%d",&n);
for (int i = 1;i <= n;i++)
scanf ("%lld",&a[i]);
sort (a + 1,a + n + 1,cmp);
scanf ("%lld",&t);
long long sum = 1;
a[n + 1] = LLONG_MIN;
for (int i = 1;i <= n;i++){
if (a[i] == t)
break;
sum++;
}
printf ("%lld",sum);
}
by XYZcoder @ 2024-03-29 20:24:59
this is the ac 代码：
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,a[10000],b;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
cin>>b;
//sort(a,a+n);
//for(int i=1;i<n;i++){
// if(a[i]==a[i-1])a[i]=99999;
//}
sort(a,a+n);
a[n] = INT_MIN;
for(int i=0;i<n;i++){
if(a[i]==b)cout<<i+1;
}
return 0;
}
by XYZcoder @ 2024-03-29 20:28:13
再从大到小排
by XYZcoder @ 2024-03-30 13:59:34