提出 #54597481

---

ソースコード 拡げる

#include<bits/stdc++.h> 
#include<functional>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef __gnu_pbds::tree<long long, __gnu_pbds::null_type, less_equal<long long>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;
// ordered set :two additional operations in log(n)
    // order_of_key: The number of items in a set that are strictly smaller than k
    // find_by_order: It returns an iterator to the ith largest element

const int MOD = 998244353;
const long long INF = 1e18;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define float long double
#define vi vector<long long>
#define pb push_back
#define mii map<long long,long long>
#define pii pair<long long ,long long>
#define x first
#define y second
#define fr(i,b) for(long long i=0;i<b;i++)
#define frr(i,a,b) for(long long i=a;i<b;i++)
#define frn for(long long i=0;i<n;i++)
#define nl '\n'
#define all(x) (x).begin(), (x).end()

template <typename T>
istream& operator>> (istream& in, vector<T>& a)
{
    for (int i = 0; i < a.size(); ++i)
        in >> a[i];
 
    return in;
}
template <typename T>
ostream& operator<< (ostream& out, vector<T>& a)
{
    for (int i = 0; i < a.size(); ++i)
        out << a[i] << " ";
 
    out << "\n";
 
    return out;
}
int binpow(int a, int b, long long m = INF){
    a %= m;
    int res = 1;
    while (b > 0){
        if (b & 1) res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
set<int>primes;
void sieve(int n){
    bool prime[n + 1];
    memset(prime, true, sizeof(prime));
    for (int  p = 2; p * p <= n; p++)
        if (prime[p] == true) 
            for (int i = p * p; i <= n; i += p) prime[i] = false;
    for (int p = 2; p <= n; p++) if (prime[p]) primes.insert(p);
}
int modinv(int x){
    return(binpow(x,MOD-2));
}   

void solve(){    
    int m,n;
    cin>>m>>n;
    vi a(m),b(n);
    cin>>a>>b;

    sort(all(b),greater<int>());

    set<int> st;
    fr(i,m) st.insert(a[i]);

    int ans = 0;

    frn{
        auto ind = st.lower_bound(b[i]);
        if(ind == st.end()){
            cout<<-1<<nl;
            return;
        }
        ans+= *ind;
        st.erase(ind);
    }
    cout<<ans<<nl;
}

signed main(){
    fast_io;
    int T = 1;          
    // cin>>T;
    while(T--){
        solve();
    }
    return 0;
}

提出情報

コンパイルエラー

Main.cpp: In instantiation of ‘std::istream& operator>>(std::istream&, std::vector<_Tp>&) [with T = long long int; std::istream = std::basic_istream<char>]’:
Main.cpp:73:10:   required from here
Main.cpp:31:23: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   31 |     for (int i = 0; i < a.size(); ++i)
      |                     ~~^~~~~~~~~~

ジャッジ結果