poj 2371 questiong and answer
来源:互联网 发布:公司取名软件下载 编辑:程序博客网 时间:2024/06/04 19:11
题意:就是一个排序,然后询问第几大的数,输出。。无聊
#include<iostream>#include<algorithm>using namespace std;int main() { int N , K; int a[100100]; char s[10]; while (scanf("%d",&N)!=EOF) { for (int i = 0 ; i < N ; i ++) scanf("%d",&a[i]); sort(a , a+N); scanf("%s",s); scanf("%d",&K); int c; while (K --) { scanf("%d",&c); printf("%d\n",a[c-1]); } } }
- poj 2371 questiong and answer
- Question and answer
- poj 1035(Wrong Answer)
- H.264 Questions and answer
- A Question And Answer Site
- Answer
- answer
- The Project Management Question and Answer Book
- The Project Management Question and Answer Book
- Answer to Computer Networks and Internet
- POJ 3908 Quick answer 并查集
- poj 3908 Quick answer//并查集
- The first and second conditional to ask and answer questions
- poj 2371 Questions and answers
- poj 2371 Questions and answers
- POJ 2371 Questions and answers
- poj 2371 Questions and answers
- the answer to life, the universe and everything
- u-boot中.lds链接脚本文件的分析
- 递归算法总结
- reverse的时候release版本和debug版本的不同之处
- 推荐一下我们的Lotus Notes/Domino团队博客
- C#中设置console和form同时显示
- poj 2371 questiong and answer
- [iOS/Android开发之WebService]How to write a webservices using php with json format
- 集成第三方库到android程序方法
- MyEclipse6.0注册码生成类(Java)
- 获取本地IP
- 判断素数 Miller-Rabin 算法
- destoon二次开发模板和调用语法参考
- android webview
- apache mina 学习(九)-----IoBuffer