soj4351k-th number pair
2014-07-27 00:37
218 查看
k-th number pair
大致题意:给你n个数a[1],a[2],......,a,总共有n^2对(a[i],a[j]),1<=i<=j<=n,问你第k对,输出他。
本身不是很难,但开始大家都狂wa,数可能有相同的,所以得另外考虑
贴上代码:
#include <iostream> #include <cstdio> #include<algorithm> #include<cstring> #include<queue> #define INF 2000000000 #define max(a,b) (a)>(b)?(a):(b) #define read(a) scanf("%d",&a); using namespace std; const int maxn = 100005; int a[maxn]; int main() { int n,k; while(scanf("%d%d",&n,&k)==2){ for(int j=0;j<n;j++)read(a[j]) sort(a,a+n); int pos=(k-1)/n,i,cnt=0,t,t1; for(i=pos;i>=0&&a[i]==a[pos];i--);t=i+1; for(i=pos;i<n&&a[i]==a[pos];i++);t1=i; k-=t*n; printf("%d %d\n",a[pos],a[(k-1)/(t1-t)]); } return 0; }
相关文章推荐
- leetcode 719. Find K-th Smallest Pair Distance
- HDU 3943 K-th Nya Number
- HDU 3943 K-th Nya Number(数位dp+二分)
- 【数位DP】HDU3943[K-th Nya Number]题解
- 【数位DP】【hdu 3943】K-th Nya Number
- HDU3943 K-th Nya Number(数位DP)
- hdu 3943 K-th Nya Number 2011多校11 数位dp
- 算法第15周Find K-th Smallest Pair Distance[hard]
- poj 2104 K-th Number && poj 2761 Feed the dogs
- hdu 3943 K-th Nya Number 数位dp
- HDU 6231 (K-th Number)
- leetcode 719. Find K-th Smallest Pair Distance 第k小的绝对距离 + 暴力计算真棒
- [数位dp] hdu 3943 K-th Nya Number
- leetcode :Find the contiguous subarray within an array (containing at least one number) which has th
- Find K-th Smallest Pair Distance:查找数组元素中差值第K大的两个元素的差值
- K-th Nya Number (数位dp+二分)
- 【POJ 2104】K-th Number&主席树详解
- HDU3943 K-th Nya Number 数位DP
- POJ 2104 K-th Number&&HDU 2665 Kth number划分树 求区间第k大 裸题
- K`th number