1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
| #include<bits/stdc++.h>
using namespace std;
#define INF 100000000
#define P pair<int,int>
#define F first
#define S second
#define PB push_back
P sl[1000000];
int main(){
ios::sync_with_stdio(0),cin.tie(0);
int t;
cin>>t;
for(int iptNum=0;iptNum<t;iptNum++){
int n,k,r=INF;
priority_queue<int> pq;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>sl[i].F>>sl[i].S;
}
sort(sl,sl+n);
for(int i=0;i<n;i++){
pq.push(sl[i].S);
if(pq.size()==k){
r=min(r,sl[i].F+pq.top());
pq.pop();
}
}
cout<<r<<"\n";
}
return 0;
}
|