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> #include <stack> using namespace std; int main() { int n, k; cin >> n >> k; int niza[n]; for(int i = 0; i < n; i++) { cin >> niza[i]; } sort(niza, niza + n); long long parovi = 0; for(int i = 0; i < n; i++) { int indeks = lower_bound(niza, niza + n, niza[i] + k) - niza; int indeks2 = lower_bound(niza, niza + n, niza[i] + k + 1) - niza; if(indeks < n and niza[indeks] == niza[i] + k) { parovi += indeks2 - indeks; } } if(k == 0) { parovi -= n; parovi /= 2; } cout << parovi << endl; return 0; } /* 8 1 1 1 1 2 2 2 3 4 */
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)
