Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { int k, n; cin >> k >> n; int a[n], b[n]; for(int i = 0; i < n; i++) { cin >> a[i]; } for(int i = 0; i < n; i++) { cin >> b[i]; } sort(a, a + n); sort(b, b + n); long long res = 0; for(int i = 0; i < n; i++) { if(a[i] >= k) { res += n; } else { int x = k - a[i]; int L = 0, R = n - 1; int idx = -1; while(L <= R) { int middle = (L + R) / 2; if(b[middle] < x) { L = middle + 1; } else { R = middle - 1; idx = middle; } } if(idx != -1 and b[idx] >= x) { res += n - idx; } } } cout << res << endl; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
