K-th Largest Value

题目：
You are given an array a consisting of n integers. Initially all elements of a are either 0 or 1. You need to process q queries of two kinds:

1 x : Assign to ax the value 1−ax.
2 k : Print the k-th largest value of the array.
As a reminder, k-th largest value of the array b is defined as following:

Sort the array in the non-increasing order, return k-th element from it.
For example, the second largest element in array [0,1,0,1] is 1, as after sorting in non-increasing order it becomes [1,1,0,0], and the second element in this array is equal to 1.

Input
The first line contains two integers n and q (1≤n,q≤105) — the length of the given array and the number of queries.

The second line contains n integers a1,a2,a3,…,an (0≤ai≤1) — elements of the initial array.

Each of the following q lines contains two integers. The first integer is t (1≤t≤2) — the type of query.

If t=1 the second integer is x (1≤x≤n) — the position of the modified number. You have to assign to ax the value 1−ax.
If t=2 the second integer is k (1≤k≤n) — you need to print the k-th largest value of the array.
It’s guaranteed that there will be at least one query of the second type (satisfying t=2).

Output
For each query of the second type, print a single integer — the answer to the query.

Example
inputCopy
5 5
1 1 0 1 0
2 3
1 2
2 3
2 1
2 5
outputCopy
1
0
1
0
Note
Initially a=[1,1,0,1,0].

The first operation is printing the third largest value, which is 1.

The second operation is assigning a2 the value 0, a becomes [1,0,0,1,0].

The third operation is printing the third largest value, it is 0.

The fourth operation is printing the first largest value, it is 1.

The last operation is printing the fifth largest value, it is 0.
题解：

#include <bits/stdc++.h>
using namespace std;
int a[1000005];
int main()
{int n,q;cin>>n>>q;int con=0;for(int i=1;i<=n;i++){scanf("%d",&a[i]);if(a[i]==1) con++;}while(q--){int t,x;cin>>t>>x;if(t==1) {a[x]=1-a[x];if(a[x]==0) con--;else con++;}else {if(x>con) cout<<"0"<<endl;else cout<<"1"<<endl;}}return 0;
}

K-th Largest Value相关推荐

PyTorch搜索Tensor指定维度的前K大个（K小个）元素--------(torch.topk)命令参数详解及举例
torch.topk 语法 torch.topk(input, k, dim=None, largest=True, sorted=True, *, out = None) 作用返回输入tensor ...
寻找无序数组中第k大的数
对于一个无序的数组,怎样找到其中第k大的数呢?下面总结几种方法. 1.直接排序法使用常见的归并排序.堆排序等算法对数组进行排序,然后找到第k大的数.排序算法的时间复杂度为O(nlogn),所以算法总 ...
MYSQL实现ORDER BY LIMIT的方法以及优先队列(堆排序)
一.MYSQL中的LIMIT和ORACLE中的分页在MYSQL官方文档中描述limit是在结果集中返回你需要的数据,它可以尽快的返回需要的行而不用管剩下的行, 在ORACLE中也有相关的语法比如 1 ...
matlab pdist2函数官方详解
pdist2 两组观测之间的成对距离句法 D = pdist2(X,Y,Distance) D = pdist2(X,Y,Distance,DistParameter) D = pdist2(___ ...
pytorch教程龙曲良21-25
21合并与分割2 split 按照长度/单元长度拆分 c的shape是[2,32,8]aa,bb=c.split(1,dim=0)#操作单元是在0维度上操作,拆分单元长度是1aa,bb=c.split ...
pytorch机器学习_机器学习— PyTorch
pytorch机器学习 PyTorch : It is an open source machine learning library based on the Torch library (whic ...
Python heapq模块
Python heapq模块 heapq模块提供了如下几个函数: 函数用法 heapq.heappush(heap, item) 把item添加到heap中(heap是一个列表) heapq.hea ...
Transformers Assemble（PART IV）
上一篇Transformers Assemble(PART III)重点在transformer位置信息的改进,这一集挑选了几篇都带有「Sparse」的标签,主要关注点在于transformer结构的 ...
基于FPGA的LSTM加速器设计（MNIST数据集为例）
摘要本文以MNIST手写数字识别任务为例,使用FPGA搭建了一个LSTM网络加速器,并选取MNIST数据集中的10张图片,通过vivado软件进行仿真验证.实验结果表明,本文设计的基于FPGA的LS ...
10万字C语言入门手册，历时三个月，详细的C语言教程终于出炉了，给你全新C语言入门体验
C语言是一种非常流行的编程语言,它是许多现代编程语言的基础. 什么是计算机? 计算机是一种用于存储.处理.和输出数据的电子设备.它通过程序控制和数学算法来实现数据处理.计算机通过输入设备(如键盘.鼠标 ...

K-th Largest Value

K-th Largest Value相关推荐

最新文章

热门文章