XidianOJ 1195 Industry of Orz Pandas

--正文

贪心

排序好慢慢找就好

#include <iostream> #include <cstring> #include <cstdio> #include <algorithm> using namespace std; typedef long long LL;int a[20001],b[20001]; int n,m,x; int main(){while (scanf("%d %d %d",&n,&m,&x) != EOF){int i,j,k;for (i=1;i<=n;i++){scanf("%d",&a[i]);}for (i=1;i<=m;i++){scanf("%d",&b[i]);}sort(a+1,a+1+n); sort(b+1,b+1+m);int nowa = 1,nowb = 1,total = 0;while (nowa <= n && nowb <= m){int res = a[nowa] - b[nowb];if (res<0) res = -res;if (res<=x){nowa ++; nowb ++; total ++; continue;} else {if (a[nowa] > b[nowb]){nowb++;}else {nowa++;}}}printf("%d\n",total);}return 0; }

 

转载于:https://www.cnblogs.com/ToTOrz/p/6202867.html

总结

以上是生活随笔为你收集整理的XidianOJ 1195 Industry of Orz Pandas的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。