Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<algorithm>
- using namespace std;
- int main(){
- long long int K,N,i,j=0,k,total=0,tempTotal=0,temp;
- cin>>N>>K;
- long long arr[N];
- for(i=0;(i+j)<N;){
- cin>>arr[i];
- if(arr[i]<K){
- i++;
- sort(arr,arr+i);
- continue;
- }
- j++;
- }
- N=i;
- for(i=0;i<N;i++){
- if(i==0||(arr[i]!=arr[i-1])){
- tempTotal=0;
- char flag=1;
- for(j=i+1;j<N&&flag;j++){
- flag=0;
- if(arr[i]+arr[j]<K){
- tempTotal++;
- flag=1;
- }
- }
- }
- else tempTotal-=(2*arr[i-1])<K;
- total+=tempTotal;
- }
- cout<<total;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement