提出 #59212070

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

using ll=long long;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using P=pair<int,int>;
using vi=vc<int>;

void solve(){
	int n,m;
	cin>>n>>m;
	vc<P> vec(n);
	for(int i=0;i<n;i++) cin>>vec[i].a>>vec[i].b;
	if(n<m){
		cout<<0<<endl;
		return;
	}
	sort(vec.begin(),vec.end());
	priority_queue <int> que;
	ll sum=0;
	ll ret=0;
	ll sd=0;
	for(int i=0;i<n;i++) sd+=max(0,vec[i].a-vec[i].b);
	if(m==1) ret=sd;
	for(int i=n-1;i>=0;i--){
		sd-=max(0,vec[i].a-vec[i].b);
		sum+=vec[i].b;
		que.push(vec[i].b);
		if(que.size()>=m){
			sum-=que.top();
			que.pop();
		}
		if(que.size()==m-1){
			ret=max(ret,sd-sum+(m-1));
		}
	}
	cout<<ret<<endl;
}
int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int T;
	cin>>T;
	while(T--) solve();
}

提出情報

コンパイルエラー

./Main.cpp:53:16: warning: comparison of integers of different signs: 'size_type' (aka 'unsigned long') and 'int' [-Wsign-compare]
                if(que.size()>=m){
                   ~~~~~~~~~~^ ~
./Main.cpp:57:16: warning: comparison of integers of different signs: 'size_type' (aka 'unsigned long') and 'int' [-Wsign-compare]
                if(que.size()==m-1){
                   ~~~~~~~~~~^ ~~~
2 warnings generated.

ジャッジ結果