problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1LL << 60
long long chose2(long long x) { return x * (x - 1) / 2; }
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N, 0);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end(), greater<int>());
for (long long i = 0; i < K; i++) {
H[i] = 0;
}
long long ans = 0;
for (long long i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1LL << 60
long long chose2(long long x) { return x * (x - 1) / 2; }
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N, 0);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end(), greater<int>());
K = min(K, N);
for (long long i = 0; i < K; i++) {
H[i] = 0;
}
long long ans = 0;
for (long long i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
} | insert | 15 | 15 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<int>());
rep(i, k) h[i] = 0;
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<int>());
if (k > n)
k = n;
rep(i, k) h[i] = 0;
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
}
| replace | 17 | 18 | 17 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> H(N);
for (ll i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (ll i = 0; i < K; i++) {
H[i] = 0;
}
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> H(N);
for (ll i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
if (N <= K) {
cout << 0 << endl;
exit(0);
}
for (ll i = 0; i < K; i++) {
H[i] = 0;
}
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
} | insert | 13 | 13 | 13 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
int ans = 0;
sort(a, a + n, greater<>());
rep(i, k) sum -= a[i];
if (sum < 0)
sum = 0;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
int ans = 0;
sort(a, a + n, greater<>());
rep(i, k) {
sum -= a[i];
if (i + 1 == n)
break;
}
if (sum < 0)
sum = 0;
cout << sum << endl;
return 0;
} | replace | 20 | 21 | 20 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define REP(i, n) for (int i(0); i < n; ++i)
#define REQ(i, a, b) for (int i(a); i <= b; ++i)
int32_t main() {
int n, k;
cin >> n >> k;
int array[n];
REP(i, n) cin >> array[i];
sort(array, array + n, greater<int>());
REP(i, k) array[i] = 0;
int ans = 0;
REP(i, n) ans += array[i];
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define REP(i, n) for (int i(0); i < n; ++i)
#define REQ(i, a, b) for (int i(a); i <= b; ++i)
int32_t main() {
int n, k;
cin >> n >> k;
int array[n];
REP(i, n) cin >> array[i];
sort(array, array + n, greater<int>());
if (k >= n)
cout << 0;
else {
REP(i, k) array[i] = 0;
int ans = 0;
REP(i, n) ans += array[i];
cout << ans;
}
return 0;
} | replace | 13 | 17 | 13 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// #pragma GCC optimize("Ofast")
// #define _GLIBCXX_DEBUG
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
// #define int ll
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define floatprec(dig) fixed << setprecision(dig)
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
#define invar(typ, var) \
typ var; \
cin >> var;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX / 2;
const ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vll H(N);
rep(i, N) cin >> H[i];
sort(all(H));
reverse(all(H));
rep(i, K) H[i] = 0;
ll sum = 0;
for (int i = K; i < N; i++)
sum += H[i];
fin(sum);
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// #pragma GCC optimize("Ofast")
// #define _GLIBCXX_DEBUG
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
// #define int ll
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define floatprec(dig) fixed << setprecision(dig)
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
#define invar(typ, var) \
typ var; \
cin >> var;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX / 2;
const ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vll H(N);
rep(i, N) cin >> H[i];
if (K >= N) {
fin(0);
return 0;
}
sort(all(H));
reverse(all(H));
rep(i, K) H[i] = 0;
ll sum = 0;
for (int i = K; i < N; i++)
sum += H[i];
fin(sum);
} | insert | 91 | 91 | 91 | 96 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int _I() {
int x;
scanf("%d", &x);
return x;
}
int mp[10005];
int ar[100005];
void solve() {
int n = _I();
int k = _I();
long long sum = 0;
for (int i = 0; i < n; i++) {
ar[i] = _I();
}
sort(ar, ar + n);
for (int i = 0; i < max(0, n - k); i++) {
sum += ar[i];
}
cout << sum << "\n";
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int _I() {
int x;
scanf("%d", &x);
return x;
}
int mp[10005];
int ar[200005];
void solve() {
int n = _I();
int k = _I();
long long sum = 0;
for (int i = 0; i < n; i++) {
ar[i] = _I();
}
sort(ar, ar + n);
for (int i = 0; i < max(0, n - k); i++) {
sum += ar[i];
}
cout << sum << "\n";
}
int main() {
solve();
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i, a)
#define rep1(i, a) rep2(i, 0, a)
#define rep2(i, b, a) for (int i = (b); i < ((int)(a)); i++)
#define rep3(i, b, a) for (int i = (b); i >= ((int)(a)); i--)
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define pow2(x) (1ll << (x))
#define print0(a) cout << (a) << ' '
#define print1(a) cout << (a) << '\n'
#define print2(a, b) cout << (a) << ' ', print1(b)
#define print3(a, b, c) cout << (a) << ' ', print2(b, c)
#define print4(a, b, c, d) cout << (a) << ' ', print3(b, c, d)
#ifdef i_am_noob
#define debug(a) print1(a)
#else
#define debug(a)
#endif
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
const int Mod = 1000000007, Mod2 = 998244353;
const int MOD = Mod2;
inline int add(int a, int b) { return (a + b >= MOD ? a + b - MOD : a + b); }
inline int sub(int a, int b) {
return (a + MOD - b >= MOD ? a - b : a + MOD - b);
}
int Pow(int a, int b) {
if (!b)
return 1;
int tmp = Pow(a * a % MOD, b >> 1);
return (b & 1 ? tmp * a % MOD : tmp);
}
inline int inverse(int n) { return Pow(n, MOD - 2); }
const int maxn = 100005;
// i_am_noob
int n, k, a[maxn], ans = 0;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> k;
rep(n) cin >> a[i];
sort(a, a + n);
rep(n) ans += (n - i <= k ? 0 : a[i]);
print1(ans);
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i, a)
#define rep1(i, a) rep2(i, 0, a)
#define rep2(i, b, a) for (int i = (b); i < ((int)(a)); i++)
#define rep3(i, b, a) for (int i = (b); i >= ((int)(a)); i--)
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define pow2(x) (1ll << (x))
#define print0(a) cout << (a) << ' '
#define print1(a) cout << (a) << '\n'
#define print2(a, b) cout << (a) << ' ', print1(b)
#define print3(a, b, c) cout << (a) << ' ', print2(b, c)
#define print4(a, b, c, d) cout << (a) << ' ', print3(b, c, d)
#ifdef i_am_noob
#define debug(a) print1(a)
#else
#define debug(a)
#endif
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
const int Mod = 1000000007, Mod2 = 998244353;
const int MOD = Mod2;
inline int add(int a, int b) { return (a + b >= MOD ? a + b - MOD : a + b); }
inline int sub(int a, int b) {
return (a + MOD - b >= MOD ? a - b : a + MOD - b);
}
int Pow(int a, int b) {
if (!b)
return 1;
int tmp = Pow(a * a % MOD, b >> 1);
return (b & 1 ? tmp * a % MOD : tmp);
}
inline int inverse(int n) { return Pow(n, MOD - 2); }
const int maxn = 200005;
// i_am_noob
int n, k, a[maxn], ans = 0;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> k;
rep(n) cin >> a[i];
sort(a, a + n);
rep(n) ans += (n - i <= k ? 0 : a[i]);
print1(ans);
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef unsigned long long int ULL;
typedef pair<int, int> PII;
typedef map<int, int> MII;
const int SZ = 112345;
const int MOD = 1e9 + 7;
int n, k, a[SZ];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int m = n - k;
LL s = 0;
for (int i = 0; i < m; i++) {
s += a[i];
}
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef unsigned long long int ULL;
typedef pair<int, int> PII;
typedef map<int, int> MII;
const int SZ = 212345;
const int MOD = 1e9 + 7;
int n, k, a[SZ];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int m = n - k;
LL s = 0;
for (int i = 0; i < m; i++) {
s += a[i];
}
cout << s << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<ll> H(n);
rep(i, n) cin >> H[i];
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
rep(i, k) H[i] = 0;
ull cnt = 0;
rep(i, n) cnt += H[i];
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<ll> H(n);
rep(i, n) cin >> H[i];
sort(H.begin(), H.end());
ll cnt = 0;
rep(i, n - k) cnt += H[i];
cout << cnt << endl;
}
| replace | 14 | 18 | 14 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
int main() {
int n, k;
std::cin >> n >> k;
VEC(ll, a, n);
int ans = 0;
sort(all(a), greater<ll>());
rep(i, k) a[i] = 0ll;
std::cout << sum(all(a), 0ll) << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
int main() {
int n, k;
std::cin >> n >> k;
VEC(ll, a, n);
int ans = 0;
sort(all(a), greater<ll>());
rep(i, min(k, n)) a[i] = 0ll;
std::cout << sum(all(a), 0ll) << std::endl;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, K, hp;
long long ans = 0;
cin >> N >> K;
vector<int> v;
for (int i = 0; i < N; i++) {
cin >> hp;
v.push_back(hp);
}
// 降順ソート
sort(v.begin(), v.end());
// 必殺技でHPが多い順に倒していく
for (int j = 0; j < K; j++) {
v.erase(v.end());
if (v.empty()) {
cout << ans << endl;
return 0;
}
}
// 残りの敵のHP=攻撃回数
ans = accumulate(v.begin(), v.end(), 0LL);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, K, hp;
long long ans = 0;
cin >> N >> K;
vector<int> v;
for (int i = 0; i < N; i++) {
cin >> hp;
v.push_back(hp);
}
// 降順ソート
sort(v.begin(), v.end());
// 必殺技でHPが多い順に倒していく
for (int j = 0; j < K; j++) {
v.pop_back();
if (v.empty()) {
cout << ans << endl;
return 0;
}
}
// 残りの敵のHP=攻撃回数
ans = accumulate(v.begin(), v.end(), 0LL);
cout << ans << endl;
return 0;
} | replace | 22 | 23 | 22 | 23 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
int main() {
int long long N, K, t = 0, i, j = 0, a;
int long long ans = 0;
cin >> N >> K;
std::vector<int long long> H(N);
for (i = 0; i < N; i++) {
cin >> a;
H[i] = a;
ans += a;
}
sort(H.begin(), H.end(), greater<>());
for (i = 0; i < K; i++) {
ans -= H[i];
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
int main() {
int long long N, K, t = 0, i, j = 0, a;
int long long ans = 0;
cin >> N >> K;
if (N <= K) {
ans = 0;
} else {
std::vector<int long long> H(N);
for (i = 0; i < N; i++) {
cin >> a;
H[i] = a;
ans += a;
}
sort(H.begin(), H.end(), greater<>());
for (i = 0; i < K; i++) {
ans -= H[i];
}
}
printf("%lld\n", ans);
return 0;
} | replace | 10 | 19 | 10 | 24 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a.rbegin(), a.rend());
for (int i = 0; i < k; i++) {
sum -= a[i];
}
cout << sum;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (k >= n) {
cout << 0;
return;
}
sort(a.rbegin(), a.rend());
for (int i = 0; i < k; i++) {
sum -= a[i];
}
cout << sum;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| insert | 11 | 11 | 11 | 15 | 0 | |
p02785 | C++ | Runtime Error | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits //stdc++.h>
using namespace std;
long long h[100001];
int main() {
long long n, k;
long long a;
cin >> n >> k;
a = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i < (n - k); i++) {
a = a + h[i];
}
cout << a;
return 0;
}
| /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits //stdc++.h>
using namespace std;
long long h[1000001];
int main() {
long long n, k;
long long a;
cin >> n >> k;
a = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i < (n - k); i++) {
a = a + h[i];
}
cout << a;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, k) for (int i = 0; i < k; i++)
ll n, m[22][22] = {}, i, j, k, h, o, l = 0, z, sam = 0, p, q;
ll a[100005] = {}, inf = 1000000000000;
ll b[100005] = {};
string s[22];
ll t[100005], xx[100005];
char ss, st;
const int MAX = 100005;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
sort(a, a + n);
z = n - k;
if (z <= 0) {
cout << 0;
return 0;
}
rep(i, z) sam += a[i];
cout << sam;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, k) for (int i = 0; i < k; i++)
ll n, m[22][22] = {}, i, j, k, h, o, l = 0, z, sam = 0, p, q;
ll a[200005] = {}, inf = 1000000000000;
ll b[100005] = {};
string s[22];
ll t[100005], xx[100005];
char ss, st;
const int MAX = 100005;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
sort(a, a + n);
z = n - k;
if (z <= 0) {
cout << 0;
return 0;
}
rep(i, z) sam += a[i];
cout << sam;
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
const int N = 2e5 + 5;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < v.size() - k; i++)
ans += v[i];
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
const int N = 2e5 + 5;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < int(v.size()) - k; i++)
ans += v[i];
cout << ans;
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int h;
int n;
int k;
int a[20009];
int main() {
while (cin >> n >> k) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0;
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
if (k > 0) {
k--;
continue;
} else {
sum += a[i];
}
}
cout << sum << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int h;
int n;
int k;
long long a[200009];
int main() {
while (cin >> n >> k) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0;
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
if (k > 0) {
k--;
continue;
} else {
sum += a[i];
}
}
cout << sum << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int h[N];
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<int>());
ll ans = 0;
for (int i = k; i < n; ++i)
ans += h[i];
cout << ans;
return 0;
}
/*
*/ | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int h[N];
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<int>());
ll ans = 0;
for (int i = k; i < n; ++i)
ans += h[i];
cout << ans;
return 0;
}
/*
*/ | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define debug(x) cout << #x << ":" << x << ' ';
#define debugg(x) cout << #x << ":" << x << ' ' << "\n";
#define endl '\n'
#define ff first
#define ss second
#define L(X) ((X) << 1)
#define R(X) (((X) << 1) | 1)
#define M(X, Y) (((X) + (Y)) >> 1)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const long long int LLINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-9;
const double PI = acos(-1);
template <typename T> T add(T x, T y, T m) { return ((x % m) + (y % m)) % m; }
template <typename T> T mul(T x, T y, T m) {
return ((x % m) * (long long)(y % m)) % m;
}
template <typename T> T sub(T x, T y, T m) { return add(x, -y + m); }
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int lg2(long long x) { return 64 - __builtin_clzll(x) - 1; }
int lg2(int x) { return 32 - __builtin_clzll(x) - 1; }
struct pair_hash {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto h1 = hash<T1>{}(p.first);
auto h2 = hash<T2>{}(p.second);
return h1 ^ h2;
}
};
ll n, k, h[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
ll sum = 0;
for (int i = 0; i < n - k; ++i) {
sum += h[i];
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define debug(x) cout << #x << ":" << x << ' ';
#define debugg(x) cout << #x << ":" << x << ' ' << "\n";
#define endl '\n'
#define ff first
#define ss second
#define L(X) ((X) << 1)
#define R(X) (((X) << 1) | 1)
#define M(X, Y) (((X) + (Y)) >> 1)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MAXN = 2e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const long long int LLINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-9;
const double PI = acos(-1);
template <typename T> T add(T x, T y, T m) { return ((x % m) + (y % m)) % m; }
template <typename T> T mul(T x, T y, T m) {
return ((x % m) * (long long)(y % m)) % m;
}
template <typename T> T sub(T x, T y, T m) { return add(x, -y + m); }
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int lg2(long long x) { return 64 - __builtin_clzll(x) - 1; }
int lg2(int x) { return 32 - __builtin_clzll(x) - 1; }
struct pair_hash {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto h1 = hash<T1>{}(p.first);
auto h2 = hash<T2>{}(p.second);
return h1 ^ h2;
}
};
ll n, k, h[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
ll sum = 0;
for (int i = 0; i < n - k; ++i) {
sum += h[i];
}
cout << sum << endl;
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
int main() {
int n, k;
ll ans = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
ans += a[i];
}
sort(a + 1, a + 1 + n);
for (int i = n; i > n - k && i >= 0; i--) {
ans -= a[i];
}
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200010];
int main() {
int n, k;
ll ans = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
ans += a[i];
}
sort(a + 1, a + 1 + n);
for (int i = n; i > n - k && i >= 0; i--) {
ans -= a[i];
}
printf("%lld\n", ans);
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int Max = 0x3f3f3f3f;
int a[100005];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
if (k >= n)
printf("0\n");
else {
ll sum = 0;
for (int i = n - k; i >= 1; i--) {
sum += a[i];
}
printf("%lld\n", sum);
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int Max = 0x3f3f3f3f;
int a[200005];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
if (k >= n)
printf("0\n");
else {
ll sum = 0;
for (int i = n - k; i >= 1; i--) {
sum += a[i];
}
printf("%lld\n", sum);
}
}
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long a, b, c, i, j;
vector<long> v;
cin >> a >> b;
for (i = 0; i < a; i++) {
cin >> c;
v.push_back(c);
}
std::sort(v.begin(), v.end(), std::greater<int>()); // 降順ソー
for (i = 0; i < b; i++) {
v[i] = 0;
}
c = 0;
for (j = i; j < v.size(); j++) {
c += v[j];
}
cout << c;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long a, b, c, i, j;
vector<long> v;
cin >> a >> b;
for (i = 0; i < a; i++) {
cin >> c;
v.push_back(c);
}
std::sort(v.begin(), v.end(), std::greater<int>()); // 降順ソー
for (i = 0; i < b; i++) {
if (i >= v.size())
break;
v[i] = 0;
}
c = 0;
for (j = i; j < v.size(); j++) {
c += v[j];
}
cout << c;
return 0;
}
| insert | 21 | 21 | 21 | 23 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int sum;
sum = accumulate(h.begin(), h.begin() + n - k, 0);
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
long long sum;
if (n > k) {
sum = accumulate(h.begin(), h.begin() + n - k, 0LL);
} else
sum = 0;
cout << sum << endl;
}
| replace | 10 | 12 | 10 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (lol i = a; i <= lol(b); i++)
#define FORD(i, a, b) for (lol i = a; i >= lol(b); i--)
#define VL vector<lol>
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end() // sortなどの引数を省略したい
#define SIZE(x) lol(x.size()) // sizeをsize_tからllに直しておく
// 定数
#define PI 3.1415926535897932385 // pi
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 最大値最小値
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
lol result{0};
lol n, k;
cin >> n >> k;
VL a(n);
REP(i, n) {
cin >> a[i];
result += a[i];
}
sort(ALL(a));
FORD(i, n - 1, n - k) { result -= a[i]; }
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (lol i = a; i <= lol(b); i++)
#define FORD(i, a, b) for (lol i = a; i >= lol(b); i--)
#define VL vector<lol>
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end() // sortなどの引数を省略したい
#define SIZE(x) lol(x.size()) // sizeをsize_tからllに直しておく
// 定数
#define PI 3.1415926535897932385 // pi
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 最大値最小値
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
lol result{0};
lol n, k;
cin >> n >> k;
VL a(n);
REP(i, n) {
cin >> a[i];
result += a[i];
}
if (k > n)
k = n;
sort(ALL(a));
FORD(i, n - 1, n - k) { result -= a[i]; }
cout << result << endl;
return 0;
} | insert | 47 | 47 | 47 | 49 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
#define int long long
#define vll vector<long long>
#define pii pair<long long, long long>
#define vvi vector<vector<long long>>
#define vpii vector<pair<int, int>>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define sec second
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define m_p make_pair
#define all(x) (x.begin(), x.end())
#define sz(v) ((int)(v.size()))
#define endl '\n'
typedef vector<long long> vi;
const int MOD = 1e9 + 7;
int size = 10000000;
int32_t main() {
fast;
/* #ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif */
int T = 1; // cin>>T;
while (T--) {
int n, k;
cin >> n >> k;
int sum = 0;
vi a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
SORTR(a);
for (int i = 0; i < k; i++) {
sum -= a[i];
}
cout << max(sum, (int)0) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
#define int long long
#define vll vector<long long>
#define pii pair<long long, long long>
#define vvi vector<vector<long long>>
#define vpii vector<pair<int, int>>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define sec second
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define m_p make_pair
#define all(x) (x.begin(), x.end())
#define sz(v) ((int)(v.size()))
#define endl '\n'
typedef vector<long long> vi;
const int MOD = 1e9 + 7;
int size = 10000000;
int32_t main() {
fast;
/* #ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif */
int T = 1; // cin>>T;
while (T--) {
int n, k;
cin >> n >> k;
int sum = 0;
vi a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
SORTR(a);
if (n > k) {
for (int i = 0; i < k; i++) {
sum -= a[i];
}
} else
sum = 0;
cout << sum << endl;
}
return 0;
} | replace | 89 | 94 | 89 | 96 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ifstream fin("hps.in");
ofstream fout("hps.out");
#define f first
#define s second
#define pb push_back
int n, k, h[100002];
ll ans;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
sort(h + 1, h + n + 1);
for (int i = 1; i <= n - k; i++)
ans += h[i];
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ifstream fin("hps.in");
ofstream fout("hps.out");
#define f first
#define s second
#define pb push_back
int n, k, h[200002];
ll ans;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
sort(h + 1, h + n + 1);
for (int i = 1; i <= n - k; i++)
ans += h[i];
cout << ans;
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
int tab[100005];
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
sort(tab, tab + n);
reverse(tab, tab + n);
int j = 0;
while (k--) {
tab[j] = 0;
if (j == n - 1)
break;
j++;
}
LL ans = 0;
for (int i = 0; i < n; i++) {
ans += tab[i];
}
cout << ans << '\n';
return 0;
}
| /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
int tab[1000005];
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
sort(tab, tab + n);
reverse(tab, tab + n);
int j = 0;
while (k--) {
tab[j] = 0;
if (j == n - 1)
break;
j++;
}
LL ans = 0;
for (int i = 0; i < n; i++) {
ans += tab[i];
}
cout << ans << '\n';
return 0;
}
| replace | 66 | 67 | 66 | 67 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
rep(i, k) h[i] = 0;
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
if (n <= k) {
cout << 0 << endl;
return 0;
}
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
rep(i, k) h[i] = 0;
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
return 0;
} | insert | 12 | 12 | 12 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// モンスターの数, 必殺技の回数
int N, K;
cin >> N >> K;
// N体のモンスターの体力
vector<long long> HP(N);
for (long long &x : HP)
cin >> x;
sort(HP.begin(), HP.end(), greater<long long>());
// HPが高い敵をK体倒す
for (auto itr = HP.begin(); itr < HP.begin() + K; ++itr) {
*itr = 0;
}
// 何回攻撃すれば勝てるか
long long cnt = 0;
for (long long x : HP)
cnt += x;
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// モンスターの数, 必殺技の回数
int N, K;
cin >> N >> K;
// N体のモンスターの体力
vector<long long> HP(N);
for (long long &x : HP)
cin >> x;
sort(HP.begin(), HP.end(), greater<long long>());
// HPが高い敵をK体倒す
for (auto itr = HP.begin(); (itr < (HP.begin() + min(K, N))); ++itr) {
*itr = 0;
}
// 何回攻撃すれば勝てるか
long long cnt = 0;
for (long long x : HP)
cnt += x;
cout << cnt << endl;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, k) { h.pop_back(); }
ll ans = 0;
rep(i, h.size()) ans += h[i];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
k = min(n, k);
rep(i, k) { h.pop_back(); }
ll ans = 0;
rep(i, h.size()) ans += h[i];
cout << ans << endl;
return 0;
}
| insert | 11 | 11 | 11 | 12 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<int> h(n);
long long tmp = 0;
long long lol = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
lol = lol + h.at(i);
}
if (k == 0) {
cout << lol << endl;
return 0;
} else if (k >= n) {
cout << "0" << endl;
} else {
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
for (int i = 0; i < k; i++) {
h.at(i) = 0;
}
for (int i = 0; i < n; i++) {
tmp = tmp + h.at(i);
}
for (int i = 0; i < 1000000000 * n; i++) {
if (tmp <= 0) {
cout << ans << endl;
return 0;
} else {
tmp--;
ans++;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<int> h(n);
long long tmp = 0;
long long lol = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
lol = lol + h.at(i);
}
if (k == 0) {
cout << lol << endl;
return 0;
} else if (k >= n) {
cout << "0" << endl;
} else {
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
for (int i = 0; i < k; i++) {
h.at(i) = 0;
}
for (int i = 0; i < n; i++) {
tmp = tmp + h.at(i);
}
cout << tmp << endl;
}
}
| replace | 33 | 42 | 33 | 34 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) {
cin >> h.at(i);
sum += h.at(i);
}
sort(h.begin(), h.end(), greater<ll>());
rep(i, k) { sum -= h.at(i); }
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) {
cin >> h.at(i);
sum += h.at(i);
}
sort(h.begin(), h.end(), greater<ll>());
rep(i, min(k, n)) { sum -= h.at(i); }
cout << sum << endl;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long count = 0;
sort(A.begin(), A.end(), greater<>());
for (int i = 0; i < K; i++) {
A[i] = 0;
}
for (int i = 0; i < N; i++) {
count += A[i];
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long count = 0;
sort(A.begin(), A.end());
for (int i = 0; i < N - K; i++) {
count += A[i];
}
cout << count << endl;
return 0;
}
| replace | 11 | 16 | 11 | 13 | 0 | |
p02785 | C++ | Runtime Error | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V) \
SORT(V); \
REV(V) // 大きい方からソート
#define NPN(V) next_permutation(ALL(V)) // 順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } // 最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(n, x);
Vi HV(n);
VIN(HV)
RSORT(HV);
REP(i, x) { HV[i] = 0; }
REP(i, n) { z += HV[i]; }
OUT(z);
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V) \
SORT(V); \
REV(V) // 大きい方からソート
#define NPN(V) next_permutation(ALL(V)) // 順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } // 最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(n, x);
Vi HV(n);
VIN(HV)
RSORT(HV);
REP(i, x) {
if (i >= n)
break;
HV[i] = 0;
}
REP(i, n) { z += HV[i]; }
OUT(z);
} | replace | 85 | 86 | 85 | 90 | 0 | |
p02785 | C++ | Runtime Error | /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k, x;
vector<ll> v;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
for (ll i = 0; i < k; i++) {
v.pop_back();
}
ll sum = 0;
for (ll i = 0; i < v.size(); i++) {
sum += v[i];
}
cout << sum << endl;
return 0;
}
| /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k, x;
vector<ll> v;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (k >= n) {
cout << 0;
return 0;
}
sort(v.begin(), v.end());
for (ll i = 0; i < k; i++) {
v.pop_back();
}
ll sum = 0;
for (ll i = 0; i < v.size(); i++) {
sum += v[i];
}
cout << sum << endl;
return 0;
}
| insert | 18 | 18 | 18 | 22 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <int id> struct CompTupleBy {
template <class T> bool operator()(const T &a, const T &b) const {
return std::get<id>(a) < std::get<id>(b);
}
};
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> vec(n);
rep(i, n) { cin >> vec[i]; }
sort(vec.begin(), vec.end(), greater<ll>());
rep(i, k) { vec[i] = 0; }
ll ans = 0;
rep(i, n) { ans += vec[i]; }
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <int id> struct CompTupleBy {
template <class T> bool operator()(const T &a, const T &b) const {
return std::get<id>(a) < std::get<id>(b);
}
};
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> vec(n);
rep(i, n) { cin >> vec[i]; }
sort(vec.begin(), vec.end(), greater<ll>());
if (k > n) {
k = n;
}
rep(i, k) { vec[i] = 0; }
ll ans = 0;
rep(i, n) { ans += vec[i]; }
cout << ans << endl;
} | insert | 24 | 24 | 24 | 27 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, n, m, M, K, a;
vector<ll> v, w;
int main() {
cin >> N >> K;
v.resize(0);
for (int i = 0; i < N; ++i) {
cin >> n;
v.push_back(n);
}
sort(v.begin(), v.end());
while (K) {
v.pop_back();
--K;
}
if (v.size() == 0)
cout << 0;
else
cout << accumulate(v.begin(), v.end(), 0LL);
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, n, m, M, K, a;
vector<ll> v, w;
int main() {
cin >> N >> K;
v.resize(0);
for (int i = 0; i < N; ++i) {
cin >> n;
v.push_back(n);
}
sort(v.begin(), v.end());
while (K and v.size() > 0) {
v.pop_back();
--K;
}
if (v.size() == 0)
cout << 0;
else
cout << accumulate(v.begin(), v.end(), 0LL);
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (ll i = 0; i < k; ++i) {
h[i] = 0;
}
ll sum = 0;
for (ll i = 0; i < n; ++i) {
sum += h[i];
}
cout << sum;
} | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (ll i = 0; i < min(n, k); ++i) {
h[i] = 0;
}
ll sum = 0;
for (ll i = 0; i < n; ++i) {
sum += h[i];
}
cout << sum;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end(), greater<int>());
for (int i = 0; i < k; i++)
h[i] = 0;
cout << accumulate(h.begin(), h.end(), 0LL) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(16);
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end(), greater<int>());
for (int i = 0; i < min(n, k); i++)
h[i] = 0;
cout << accumulate(h.begin(), h.end(), 0LL) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(16);
solve();
return 0;
}
| replace | 20 | 21 | 20 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a[100005], k, s = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - k; i++)
s += a[i];
cout << s;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a[200005], k, s = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - k; i++)
s += a[i];
cout << s;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> HP(n);
for (int i = 0; i < n; i++) {
cin >> HP.at(i);
}
sort(HP.begin(), HP.end());
for (int i = 0; i < k; i++) {
HP.pop_back();
}
long long sum = 0;
for (int i = 0; i < HP.size(); i++) {
sum += HP.at(i);
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n <= k) {
cout << "0" << endl;
return 0;
}
vector<int> HP(n);
for (int i = 0; i < n; i++) {
cin >> HP.at(i);
}
sort(HP.begin(), HP.end());
for (int i = 0; i < k; i++) {
HP.pop_back();
}
long long sum = 0;
for (int i = 0; i < HP.size(); i++) {
sum += HP.at(i);
}
cout << sum << endl;
} | insert | 6 | 6 | 6 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, h[100100], i, ans = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, h[200100], i, ans = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14159265358979323844
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define sqr(a) (a) * (a)
#define LCM(m, n) m *(n / __gcd(m, n))
#define inputarr(a, n) \
for (int xxx = 0; xxx < n; ++xxx) \
cin >> (a)[xxx]
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define display(x) \
trav(a, x) cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define between(n, a, b) (a <= n && n <= b)
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &out, std::pair<T, U> a) {
out << a.fi << " " << a.se;
return out;
}
template <typename T, typename U>
std::istream &operator>>(std::istream &in, std::pair<T, U> &a) {
in >> a.fi >> a.se;
return in;
}
inline long long toint(const std::string &s) {
std::stringstream ss;
ss << s;
long long x;
ss >> x;
return x;
}
inline std::string tostring(long long number) {
std::stringstream ss;
ss << number;
return ss.str();
}
inline std::string tobin(long long x) { return std::bitset<63>(x).to_string(); }
std::mt19937_64
rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pii std::pair<int, int>
#define pll std::pair<ll, ll>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define point complex<ll>
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
/*----------------------Graph Moves----------------*/
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
// primes for hashing 937,991,1013,1409,1741
using namespace std;
using namespace __gnu_pbds;
void meowmeow321() {
int n, k;
cin >> n >> k;
ll int h[n];
inputarr(h, n);
sort(h, h + n);
reverse(h, h + n);
cout << accumulate(h + k, h + n, 0ll);
}
signed main() {
FAST;
int testcases = 1;
// cin>>testcases;
for (int i = 0; i < testcases; ++i) {
meowmeow321();
}
cerr << endl << "Time Elasped : " << elasped_time << endl;
return 0;
} | // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14159265358979323844
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define sqr(a) (a) * (a)
#define LCM(m, n) m *(n / __gcd(m, n))
#define inputarr(a, n) \
for (int xxx = 0; xxx < n; ++xxx) \
cin >> (a)[xxx]
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define display(x) \
trav(a, x) cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define between(n, a, b) (a <= n && n <= b)
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &out, std::pair<T, U> a) {
out << a.fi << " " << a.se;
return out;
}
template <typename T, typename U>
std::istream &operator>>(std::istream &in, std::pair<T, U> &a) {
in >> a.fi >> a.se;
return in;
}
inline long long toint(const std::string &s) {
std::stringstream ss;
ss << s;
long long x;
ss >> x;
return x;
}
inline std::string tostring(long long number) {
std::stringstream ss;
ss << number;
return ss.str();
}
inline std::string tobin(long long x) { return std::bitset<63>(x).to_string(); }
std::mt19937_64
rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pii std::pair<int, int>
#define pll std::pair<ll, ll>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define point complex<ll>
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
/*----------------------Graph Moves----------------*/
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
// primes for hashing 937,991,1013,1409,1741
using namespace std;
using namespace __gnu_pbds;
void meowmeow321() {
int n, k;
cin >> n >> k;
ll int h[n];
inputarr(h, n);
sort(h, h + n);
reverse(h, h + n);
cout << accumulate(h + min(n, k), h + n, 0ll);
}
signed main() {
FAST;
int testcases = 1;
// cin>>testcases;
for (int i = 0; i < testcases; ++i) {
meowmeow321();
}
cerr << endl << "Time Elasped : " << elasped_time << endl;
return 0;
} | replace | 126 | 127 | 126 | 127 | 0 |
Time Elasped : 0.028346
|
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
// vector<unsigned int> h(n);
unsigned int h[20000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
reverse(h, h + n);
for (int i = 0; i < k; i++) {
h[i] = 0;
}
unsigned long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += h[i];
}
cout << ans << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
// vector<unsigned int> h(n);
unsigned int h[200005];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
reverse(h, h + n);
for (int i = 0; i < k; i++) {
h[i] = 0;
}
unsigned long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += h[i];
}
cout << ans << "\n";
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02785 | C++ | Runtime Error | /*
Md.Fagun Molla
18ICTCSE006
BSMRSTU(SHIICT)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define End return 0
int main() {
ll n, a;
cin >> n >> a;
ll aa[a];
ll s = 0;
for (ll i = 0; i < n; i++) {
cin >> aa[i];
s += aa[i];
}
if (n <= a)
cout << "0" << endl;
else {
sort(aa, aa + n);
ll p = 0;
for (ll i = 0; i < a; i++) {
p += (aa[n - i - 1]);
}
cout << s - p << endl;
}
}
/* pray for me
All is well
*/
| /*
Md.Fagun Molla
18ICTCSE006
BSMRSTU(SHIICT)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define End return 0
int main() {
ll n, a;
cin >> n >> a;
ll aa[n];
ll s = 0;
for (ll i = 0; i < n; i++) {
cin >> aa[i];
s += aa[i];
}
if (n <= a)
cout << "0" << endl;
else {
sort(aa, aa + n);
ll p = 0;
for (ll i = 0; i < a; i++) {
p += (aa[n - i - 1]);
}
cout << s - p << endl;
}
}
/* pray for me
All is well
*/
| replace | 14 | 15 | 14 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int aa[100005];
long long int ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d", &aa[i]);
}
sort(aa + 1, aa + 1 + n);
if (m >= n)
cout << "0";
else {
for (int i = 1; i <= n - m; i++) {
ans = ans + aa[i];
}
cout << ans;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int aa[200005];
long long int ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d", &aa[i]);
}
sort(aa + 1, aa + 1 + n);
if (m >= n)
cout << "0";
else {
for (int i = 1; i <= n - m; i++) {
ans = ans + aa[i];
}
cout << ans;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k, ar[100005], i, sum = 0;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n, greater<int>());
for (i = k; i < n; i++)
sum += ar[i];
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k, ar[200005], i, sum = 0;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n, greater<int>());
for (i = k; i < n; i++)
sum += ar[i];
cout << sum << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define il inline
#define re register
#define debug printf("Now is Line : %d\n", __LINE__)
#define file(a) \
freopen(#a ".in", "r", stdin); \
freopen(#a ".out", "w", stdout)
#define int long long
#define D double
#define inf 123456789
#define mod 1000000007
il int read() {
re int x = 0, f = 1;
re char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - 48, c = getchar();
return x * f;
}
#define rep(i, a, b) for (int i = (a), i##Limit = (b); i <= i##Limit; ++i)
#define drep(i, b, a) for (int i = (a), i##Limit = (b); i >= i##Limit; --i)
#define Next(i, u) for (re int i = head[u]; i; i = e[i].next)
#define mem(k, p) memset(k, p, sizeof(k))
#define lb(x) (x) & (-(x))
#define ls k * 2
#define rs k * 2 + 1
#define maxn 100005
il int Mul(int a, int b) { return 1ll * a * b % mod; }
il int Inc(int a, int b) { return (a += b) >= mod ? a - mod : a; }
il int Dec(int a, int b) { return (a -= b) < 0 ? a + mod : a; }
il int qpow(int a, int b) {
int r = 1;
while (b) {
if (b & 1)
r = Mul(r, a);
a = Mul(a, a), b >>= 1;
}
return r;
}
int n, m, a[maxn], sum;
il bool cmp(int a, int v) { return a > v; }
signed main() {
n = read(), m = read();
rep(i, 1, n) a[i] = read();
sort(a + 1, a + n + 1, cmp);
rep(i, m + 1, n) sum += a[i];
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define il inline
#define re register
#define debug printf("Now is Line : %d\n", __LINE__)
#define file(a) \
freopen(#a ".in", "r", stdin); \
freopen(#a ".out", "w", stdout)
#define int long long
#define D double
#define inf 123456789
#define mod 1000000007
il int read() {
re int x = 0, f = 1;
re char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - 48, c = getchar();
return x * f;
}
#define rep(i, a, b) for (int i = (a), i##Limit = (b); i <= i##Limit; ++i)
#define drep(i, b, a) for (int i = (a), i##Limit = (b); i >= i##Limit; --i)
#define Next(i, u) for (re int i = head[u]; i; i = e[i].next)
#define mem(k, p) memset(k, p, sizeof(k))
#define lb(x) (x) & (-(x))
#define ls k * 2
#define rs k * 2 + 1
#define maxn 500005
il int Mul(int a, int b) { return 1ll * a * b % mod; }
il int Inc(int a, int b) { return (a += b) >= mod ? a - mod : a; }
il int Dec(int a, int b) { return (a -= b) < 0 ? a + mod : a; }
il int qpow(int a, int b) {
int r = 1;
while (b) {
if (b & 1)
r = Mul(r, a);
a = Mul(a, a), b >>= 1;
}
return r;
}
int n, m, a[maxn], sum;
il bool cmp(int a, int v) { return a > v; }
signed main() {
n = read(), m = read();
rep(i, 1, n) a[i] = read();
sort(a + 1, a + n + 1, cmp);
rep(i, m + 1, n) sum += a[i];
cout << sum;
return 0;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pb emplace_back
#define re return
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265359;
int n, k;
int main() {
// freopen("distance.in", "r", stdin);
// freopen("distance.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(all(a));
reverse(all(a));
for (int i = 0; i < k; i++)
a[i] = 0;
cout << accumulate(all(a), 0ll);
}
/// ACTUAL CODE STARTS HERE:
// I'm red in soul
/*
▄▀▀▀▄
▄███▀░◐░░░▌
▌░░░░░▐
▐░░░░░▐
▌░░░░░▐▄▄
▌░░░░▄▀▒▒▀▀▀▀▄
▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
▌▌░▌▌
▌▌░▌▌
▄▄▌▌▄▌▌ */
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pb emplace_back
#define re return
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265359;
int n, k;
int main() {
// freopen("distance.in", "r", stdin);
// freopen("distance.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(all(a));
reverse(all(a));
for (int i = 0; i < min(n, k); i++)
a[i] = 0;
cout << accumulate(all(a), 0ll);
}
/// ACTUAL CODE STARTS HERE:
// I'm red in soul
/*
▄▀▀▀▄
▄███▀░◐░░░▌
▌░░░░░▐
▐░░░░░▐
▌░░░░░▐▄▄
▌░░░░▄▀▒▒▀▀▀▀▄
▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
▌▌░▌▌
▌▌░▌▌
▄▄▌▌▄▌▌ */
| replace | 40 | 41 | 40 | 41 | 0 | |
p02785 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main() {
int n, k;
cin >> n >> k;
vi h(n);
rep(i, 0, n) cin >> h[i];
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
ll ans = 0;
rep(i, k - 1, n) { ans += h[i]; }
cout << ans << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main() {
int n, k;
cin >> n >> k;
vi h(n);
rep(i, 0, n) cin >> h[i];
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
ll ans = 0;
rep(i, k, n) { ans += h[i]; }
cout << ans << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100000;
int main() {
int N, K;
int H[MAX];
long long ans = 0;
cin >> N >> K;
if (N - K <= 0) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N);
for (int i = 0; i < N - K; i++) {
ans += H[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 200000;
int main() {
int N, K;
int H[MAX];
long long ans = 0;
cin >> N >> K;
if (N - K <= 0) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N);
for (int i = 0; i < N - K; i++) {
ans += H[i];
}
cout << ans << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MAXX 500005
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define PF push_front
#define F first
#define S second
#define fixx(n) fixed << setprecision(n)
#define ll long long
#define mod 1000000007
int main() {
FAST;
int n, k;
cin >> n >> k;
int a[n + 6];
ll int x = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
x += a[i];
}
sort(a, a + n);
reverse(a, a + n);
for (int i = 0; i < k; i++) {
x -= a[i];
}
if (k >= n) {
x = 0;
}
cout << x;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MAXX 500005
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define PF push_front
#define F first
#define S second
#define fixx(n) fixed << setprecision(n)
#define ll long long
#define mod 1000000007
int main() {
FAST;
int n, k;
cin >> n >> k;
int a[max(n, k) + 6] = {0};
ll int x = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
x += a[i];
}
sort(a, a + n);
reverse(a, a + n);
for (int i = 0; i < k; i++) {
x -= a[i];
}
if (k >= n) {
x = 0;
}
cout << x;
return 0;
} | replace | 27 | 28 | 27 | 28 | 0 | |
p02785 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
#define fill(a) memset(a, 0, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fixed;
#define rep(i, a) for (int(i) = 0; (i) < (int)(a); (i)++)
#define rep1(i, a, b) for (int i = (a); i <= (b); ++i)
#define irep(i, b, a) for (int i = (b); i >= (a); --i)
#define minv(v) *min_element(v.begin(), v.end())
#define maxv(v) *max_element(v.begin(), v.end())
#define each(it, s) for (auto it = s.begin(); it != s.end(); ++it)
#define unq(v) \
sort(all(v)), (v).erase(unique((v).begin(), (v).end()), (v).end())
#define getpos(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define _ios \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
const double pi = acos(-1.0);
const int mod = 1000000007; // (int)1e9+7
const int maxn = 2000100;
int main() {
_ios;
ll n, k;
cin >> n >> k;
vll h(n);
rep(i, n) cin >> h[i];
sort(all(h));
reverse(all(h));
int x = 0;
while (k--) {
h[x++] = 0;
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += h[i];
}
cout << sum << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
#define fill(a) memset(a, 0, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fixed;
#define rep(i, a) for (int(i) = 0; (i) < (int)(a); (i)++)
#define rep1(i, a, b) for (int i = (a); i <= (b); ++i)
#define irep(i, b, a) for (int i = (b); i >= (a); --i)
#define minv(v) *min_element(v.begin(), v.end())
#define maxv(v) *max_element(v.begin(), v.end())
#define each(it, s) for (auto it = s.begin(); it != s.end(); ++it)
#define unq(v) \
sort(all(v)), (v).erase(unique((v).begin(), (v).end()), (v).end())
#define getpos(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define _ios \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
const double pi = acos(-1.0);
const int mod = 1000000007; // (int)1e9+7
const int maxn = 2000100;
int main() {
_ios;
ll n, k;
cin >> n >> k;
vll h(n);
rep(i, n) cin >> h[i];
sort(all(h));
n -= k;
ll sum = 0;
for (ll i = 0; i < n; i++) {
sum += h[i];
}
cout << sum << endl;
return 0;
}
| replace | 39 | 46 | 39 | 42 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <float.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, K, H[100000] = {};
long long ans = 0;
cin >> N >> K;
if (K >= N) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N, greater<int>());
for (int i = K; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <float.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, K, H[1000000];
long long ans = 0;
cin >> N >> K;
if (K >= N) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N, greater<int>());
for (int i = K; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k, i;
cin >> n >> k;
lli a[n];
lli sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (k >= n) {
cout << 0;
return 0;
} else {
for (i = n - 1; i >= 0; i++) {
if (k == 0)
break;
else
sum -= a[i];
k--;
}
cout << sum;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k, i;
cin >> n >> k;
lli a[n];
lli sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (k >= n) {
cout << 0;
return 0;
} else {
sort(a, a + n);
for (i = n - 1; i >= 0; i--) {
if (k == 0)
break;
else
sum -= a[i];
k--;
}
cout << sum;
}
}
| replace | 18 | 19 | 18 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int n, k, a[101010];
int main() {
cin >> n >> k;
i64 ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int n, k, a[201010];
int main() {
cin >> n >> k;
i64 ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
int H[N];
int sum = 0;
rep(i, N) {
cin >> H[i];
sum += H[i];
}
sort(H, H + N);
reverse(H, H + N);
rep(i, K) { sum -= H[i]; }
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
int H[N];
int sum = 0;
rep(i, N) {
cin >> H[i];
sum += H[i];
}
sort(H, H + N);
reverse(H, H + N);
rep(i, min(K, N)) { sum -= H[i]; }
cout << sum << endl;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h;
for (ll i = 0; i < n; i++) {
ll H;
cin >> H;
h.push_back(H);
}
sort(h.rbegin(), h.rend());
for (ll i = 0; i < k; i++) {
h[i] = 0;
}
ll sum = 0;
for (ll i = 0; i < n; i++) {
sum += h[i];
}
cout << sum << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h;
for (ll i = 0; i < n; i++) {
ll H;
cin >> H;
h.push_back(H);
}
sort(h.rbegin(), h.rend());
if (n > k) {
for (ll i = 0; i < k; i++) {
h[i] = 0;
}
} else {
cout << 0 << endl;
return 0;
}
ll sum = 0;
for (ll i = 0; i < n; i++) {
sum += h[i];
}
cout << sum << endl;
}
| replace | 23 | 25 | 23 | 30 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
// double c(double x)
// {
// double X = x;
// X = int(X) % 10;
// return X;
// }
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (ll i = 0; i < k - 1; i++) {
h[i] = 0;
}
ll sum = 0;
for (ll i = 0; i < n; i++) {
sum += h[i];
}
cout << sum << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
// double c(double x)
// {
// double X = x;
// X = int(X) % 10;
// return X;
// }
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (ll i = 0; i < min(k, n); i++) {
h[i] = 0;
}
ll sum = 0;
for (ll i = 0; i < n; i++) {
sum += h[i];
}
cout << sum << endl;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// 体力の高いモンスターの順にソート
// k番目の要素から体力を足し算して出力
int N, K;
cin >> N >> K;
int h[10 ^ 6 + 10];
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h, h + N, greater<int>());
long sum = 0;
for (int i = K; i < N; ++i)
sum += h[i];
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// 体力の高いモンスターの順にソート
// k番目の要素から体力を足し算して出力
int N, K;
cin >> N >> K;
int h[200010];
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h, h + N, greater<int>());
long sum = 0;
for (int i = K; i < N; ++i)
sum += h[i];
cout << sum << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll powk(ll a, ll n) {
ll r = 1;
for (ll i = 0; i < n; i++) {
r *= a;
}
return r;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
for (ll i = n - 1; i >= n - k; i--) {
h[i] = 0;
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += h[i];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll powk(ll a, ll n) {
ll r = 1;
for (ll i = 0; i < n; i++) {
r *= a;
}
return r;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
for (ll i = n - 1; i >= n - k && i >= 0; i--) {
h[i] = 0;
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += h[i];
}
cout << ans;
return 0;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
vector<LL> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.end(), greater<>());
cout << accumulate(H.begin() + K, H.end(), 0L) << endl;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
vector<LL> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.end(), greater<>());
LL ans = 0;
if (H.size() > K)
ans = accumulate(H.begin() + K, H.end(), 0L);
cout << ans << endl;
} | replace | 19 | 20 | 19 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using u32 = uint32_t;
using u64 = uint64_t;
using i32 = int32_t;
using i64 = int64_t;
int main() {
std::ios_base::sync_with_stdio(0);
i64 n, k;
std::cin >> n >> k;
std::vector<i64> h(n);
for (i64 i = 0; i < n; ++i) {
std::cin >> h[i];
}
std::sort(h.begin(), h.end(), std::greater<i64>());
for (i64 i = 0; i < k; ++i) {
h[i] = 0;
}
i64 ans = std::accumulate(h.begin(), h.end(), 0LL);
std::cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using u32 = uint32_t;
using u64 = uint64_t;
using i32 = int32_t;
using i64 = int64_t;
int main() {
std::ios_base::sync_with_stdio(0);
i64 n, k;
std::cin >> n >> k;
std::vector<i64> h(n);
for (i64 i = 0; i < n; ++i) {
std::cin >> h[i];
}
std::sort(h.begin(), h.end(), std::greater<i64>());
for (i64 i = 0; i < std::min(k, n); ++i) {
h[i] = 0;
}
i64 ans = std::accumulate(h.begin(), h.end(), 0LL);
std::cout << ans << "\n";
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<>());
h.erase(h.begin(), h.begin() + k);
ll ans = 0;
rep(i, h.size()) ans += h[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<>());
k = min(k, n);
h.erase(h.begin(), h.begin() + k);
ll ans = 0;
rep(i, h.size()) ans += h[i];
cout << ans << endl;
return 0;
} | insert | 13 | 13 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, k) { h.pop_back(); }
ll sum = 0;
rep(i, h.size()) sum += h[i];
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
k = min(n, k);
rep(i, k) { h.pop_back(); }
ll sum = 0;
rep(i, h.size()) sum += h[i];
cout << sum << endl;
return 0;
}
| insert | 11 | 11 | 11 | 12 | 0 | |
p02785 | C++ | Runtime Error | // list index out of rangeエラー表示用
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long long> H(n);
rep(i, 0, n) { cin >> H[i]; }
rep(i, 0, n) {}
sort(H.begin(), H.end());
rep(i, 0, k) { H.pop_back(); }
cout << accumulate(H.begin(), H.end(), 0LL);
} | // list index out of rangeエラー表示用
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long long> H(n);
rep(i, 0, n) { cin >> H[i]; }
rep(i, 0, n) {}
sort(H.begin(), H.end());
rep(i, 0, k) {
if (!H.empty())
H.pop_back();
}
H.push_back(0);
cout << accumulate(H.begin(), H.end(), 0LL);
} | replace | 13 | 14 | 13 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Int long long
#define pb push_back
using namespace std;
Int N, M, K;
Int X, Y, Z, D;
const int MAXN = 105;
Int B, C;
struct DisJointSet {
vector<int> SZ;
vector<int> ID;
int n;
DisJointSet(int n) {
SZ.resize(n);
ID.resize(n);
this->n = n;
for (int i = 0; i < n; ++i) {
ID[i] = i;
SZ[i] = 1;
}
}
int find(int x) { return (ID[x] == x ? x : find(ID[x])); }
void Union_find(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (SZ[x] > SZ[y]) {
ID[y] = x;
SZ[x] += SZ[y];
} else {
ID[x] = y;
SZ[y] += SZ[x];
}
return;
}
};
int main() {
cin >> N >> M;
vector<Int> A(N);
Int sum = 0;
for (auto &x : A)
cin >> x, sum += x;
sort(A.rbegin(), A.rend());
Int ans = 0;
for (int i = 0; i < M; ++i) {
ans += A[i];
}
ans = sum - ans;
ans = max(ans, 0LL);
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define Int long long
#define pb push_back
using namespace std;
Int N, M, K;
Int X, Y, Z, D;
const int MAXN = 105;
Int B, C;
struct DisJointSet {
vector<int> SZ;
vector<int> ID;
int n;
DisJointSet(int n) {
SZ.resize(n);
ID.resize(n);
this->n = n;
for (int i = 0; i < n; ++i) {
ID[i] = i;
SZ[i] = 1;
}
}
int find(int x) { return (ID[x] == x ? x : find(ID[x])); }
void Union_find(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (SZ[x] > SZ[y]) {
ID[y] = x;
SZ[x] += SZ[y];
} else {
ID[x] = y;
SZ[y] += SZ[x];
}
return;
}
};
int main() {
cin >> N >> M;
vector<Int> A(N);
Int sum = 0;
for (auto &x : A)
cin >> x, sum += x;
sort(A.rbegin(), A.rend());
Int ans = 0;
for (int i = 0; i < min(N, M); ++i) {
ans += A[i];
}
ans = sum - ans;
ans = max(ans, 0LL);
cout << ans << "\n";
} | replace | 54 | 55 | 54 | 55 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, K, H[101010];
ll i, j, k;
int main() {
scanf("%lld%lld", &N, &K);
fornum(i, 0, N) { scanf("%lld", &H[i]); }
sort(H, H + N);
if (N <= K) {
printf("0");
return 0;
}
fornum(i, 0, K) { H[N - 1 - i] = 0; }
ll ans = 0;
fornum(i, 0, N) { ans += H[i]; }
printf("%lld", ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, K, H[202020];
ll i, j, k;
int main() {
scanf("%lld%lld", &N, &K);
fornum(i, 0, N) { scanf("%lld", &H[i]); }
sort(H, H + N);
if (N <= K) {
printf("0");
return 0;
}
fornum(i, 0, K) { H[N - 1 - i] = 0; }
ll ans = 0;
fornum(i, 0, N) { ans += H[i]; }
printf("%lld", ans);
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.rbegin(), h.rend());
rep(i, k) h[i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.rbegin(), h.rend());
if (k > n)
k = n;
rep(i, k) h[i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | insert | 13 | 13 | 13 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main() {
int n, k;
cin >> n >> k;
vec<long> h(n);
for (auto &&e : h) {
cin >> e;
}
sort(h.rbegin(), h.rend());
long ans = 0ll;
auto it = h.begin();
it += k;
while (it != h.end()) {
ans += *it;
it++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main() {
int n, k;
cin >> n >> k;
vec<long> h(n);
for (auto &&e : h) {
cin >> e;
}
sort(h.rbegin(), h.rend());
long ans = 0ll;
auto it = h.begin();
while (it != h.end() and k != 0) {
it++;
k--;
}
while (it != h.end()) {
ans += *it;
it++;
}
cout << ans << endl;
} | replace | 15 | 16 | 15 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mem(dp, v) memset(dp, v, sizeof dp);
using namespace std;
const int N = 1e3 + 7, inf = 1e9;
ll ar[N], dp[N][N], n, k, t;
int main() {
ll n, k, pw = 1, tot = 0;
// ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
for (int i = n - k - 1; i >= 0; i--)
tot += ar[i];
cout << tot << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mem(dp, v) memset(dp, v, sizeof dp);
using namespace std;
const int N = 1e6 + 7, inf = 1e9;
ll ar[N], n, k, t;
int main() {
ll n, k, pw = 1, tot = 0;
// ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
for (int i = n - k - 1; i >= 0; i--)
tot += ar[i];
cout << tot << "\n";
return 0;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
long long int all[100006];
long long int attackTimes = 0;
cin >> n >> k;
for (long long int i = 0; i < n; i++)
cin >> all[i];
sort(all, all + n);
// cout<<all[0]<<endl;
long long int t = n - k;
if (k >= n) {
cout << attackTimes << endl;
return 0;
} else {
for (long long int i = 0; i < t; i++)
attackTimes += all[i];
}
cout << attackTimes << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
long long int all[300006];
long long int attackTimes = 0;
cin >> n >> k;
for (long long int i = 0; i < n; i++)
cin >> all[i];
sort(all, all + n);
// cout<<all[0]<<endl;
long long int t = n - k;
if (k >= n) {
cout << attackTimes << endl;
return 0;
} else {
for (long long int i = 0; i < t; i++)
attackTimes += all[i];
}
cout << attackTimes << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
bool primeNumber(ll n) {
if (n < 2)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end(), greater<ll>());
ll total = 0;
for (ll i = 0; i < n; i++) {
total += h[i];
}
for (ll i = 0; i < k; i++) {
total -= h[i];
}
cout << total << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
bool primeNumber(ll n) {
if (n < 2)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end(), greater<ll>());
ll total = 0;
for (ll i = 0; i < n; i++) {
total += h[i];
}
for (ll i = 0; i < min(k, n); i++) {
total -= h[i];
}
cout << total << endl;
return 0;
}
| replace | 52 | 53 | 52 | 53 | 0 | |
p02785 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> hp(n);
rep(i, n) cin >> hp[i];
sort(all(hp));
reverse(all(hp));
ll ans = 0;
for (int i = k - 1; i < n; i++) {
ans += hp[i];
}
dunk(ans);
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> hp(n);
rep(i, n) cin >> hp[i];
sort(all(hp));
reverse(all(hp));
ll ans = 0;
for (int i = k; i < n; i++) {
ans += hp[i];
}
dunk(ans);
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ld long double
#define pii pair<int, int>
#define sz(a) (int)(a.size())
#define resize(v) v.resize(unique(all(v)) - v.begin());
#define all(a) a.begin(), a.end()
#define forit(it, s) \
for (__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
// random_device rd; mt19937 g(rd());
using namespace std;
using namespace __gnu_pbds;
void Fast_Read_Out() {
ios_base::sync_with_stdio(0);
cin.tie(), cout.tie();
}
void Random() {
unsigned int seed;
asm("rdtsc" : "=A"(seed));
srand(seed);
}
unsigned int Time() {
unsigned int time = clock() / 1000.00;
return time;
}
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int mod = (int)1e9 + 7;
const int N = (int)1e5 + 123;
int a[N];
int main() {
#ifdef JUDGE
freopen("input.txt", "r", stdin);
#endif
Fast_Read_Out();
Random();
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
long long sum = 0;
for (int i = k + 1; i <= n; i++)
sum += a[i];
cout << sum;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ld long double
#define pii pair<int, int>
#define sz(a) (int)(a.size())
#define resize(v) v.resize(unique(all(v)) - v.begin());
#define all(a) a.begin(), a.end()
#define forit(it, s) \
for (__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
// random_device rd; mt19937 g(rd());
using namespace std;
using namespace __gnu_pbds;
void Fast_Read_Out() {
ios_base::sync_with_stdio(0);
cin.tie(), cout.tie();
}
void Random() {
unsigned int seed;
asm("rdtsc" : "=A"(seed));
srand(seed);
}
unsigned int Time() {
unsigned int time = clock() / 1000.00;
return time;
}
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
int a[N];
int main() {
#ifdef JUDGE
freopen("input.txt", "r", stdin);
#endif
Fast_Read_Out();
Random();
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
long long sum = 0;
for (int i = k + 1; i <= n; i++)
sum += a[i];
cout << sum;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
vector<int64_t> H(100010);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.begin() + N);
int64_t ans = 0;
for (int i = 0; i < N - K; i++) {
ans += H[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
vector<int64_t> H(200010);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.begin() + N);
int64_t ans = 0;
for (int i = 0; i < N - K; i++) {
ans += H[i];
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <class T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
const int INF = 1e18, MOD = 1e9 + 7;
signed main() {
INCANT;
int n, k, h, res = 0;
cin >> n >> k;
priority_queue<int> q;
rep(i, n) {
cin >> h;
q.push(h);
}
while (k--) {
q.pop();
}
while (!q.empty()) {
res += q.top();
q.pop();
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <class T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
const int INF = 1e18, MOD = 1e9 + 7;
signed main() {
INCANT;
int n, k, h, res = 0;
cin >> n >> k;
priority_queue<int> q;
rep(i, n) {
cin >> h;
q.push(h);
}
while (k-- && !q.empty()) {
q.pop();
}
while (!q.empty()) {
res += q.top();
q.pop();
}
cout << res << endl;
}
| replace | 28 | 29 | 28 | 29 | TLE | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define LL long long
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 1e5 + 7;
int a[maxn];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + n + 1);
LL sum = 0;
for (int i = 1; i <= n - k; i++) {
sum += 1LL * a[i];
}
printf("%lld\n", sum);
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define LL long long
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 2e5 + 7;
int a[maxn];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + n + 1);
LL sum = 0;
for (int i = 1; i <= n - k; i++) {
sum += 1LL * a[i];
}
printf("%lld\n", sum);
}
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n, k;
ll h[20000];
cin >> n;
cin >> k;
rep(i, n) { cin >> h[i]; }
sort(h, h + n, greater<ll>());
ll dmg = 0;
for (int i = k; i < n; i++) {
dmg += h[i];
}
cout << dmg;
return 0;
}
| #include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n, k;
ll h[1000000];
cin >> n;
cin >> k;
rep(i, n) { cin >> h[i]; }
sort(h, h + n, greater<ll>());
ll dmg = 0;
for (int i = k; i < n; i++) {
dmg += h[i];
}
cout << dmg;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int h, n, dif, sum = 0, a[1000];
cin >> h >> n;
dif = h - n;
if (dif <= 0)
cout << "0" << endl;
else {
for (long long int i = 0; i < h; i++) {
cin >> a[i];
// sum += a;
}
sort(a, a + h);
for (int i = 0; i < h - n; i++) {
sum += a[i];
}
cout << sum << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int h, n, dif, sum = 0, a[1000000];
cin >> h >> n;
dif = h - n;
if (dif <= 0)
cout << "0" << endl;
else {
for (long long int i = 0; i < h; i++) {
cin >> a[i];
// sum += a;
}
sort(a, a + h);
for (int i = 0; i < h - n; i++) {
sum += a[i];
}
cout << sum << endl;
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll w[100000];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
w[i] = a;
}
sort(w, w + n);
for (int i = 0; i < n - k; i++)
sum += w[i];
cout << sum << '\n';
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll w[300000];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
w[i] = a;
}
sort(w, w + n);
for (int i = 0; i < n - k; i++)
sum += w[i];
cout << sum << '\n';
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
int main(void) {
long long N, K, H[200005], S, i;
scanf("%lld%lld", &N, &K);
for (i = 0; i < N; i++)
scanf("%lld", &H[i]);
std::sort(H, H + N);
for (i = N - K; i < N; i++)
H[i] = 0;
S = 0;
for (i = 0; i < N; i++)
S += H[i];
printf("%lld", S);
return 0;
} | #include <algorithm>
#include <stdio.h>
int main(void) {
long long N, K, H[200005], S, i;
scanf("%lld%lld", &N, &K);
if (K >= N) {
printf("0");
return 0;
}
for (i = 0; i < N; i++)
scanf("%lld", &H[i]);
std::sort(H, H + N);
for (i = N - K; i < N; i++)
H[i] = 0;
S = 0;
for (i = 0; i < N; i++)
S += H[i];
printf("%lld", S);
return 0;
} | insert | 6 | 6 | 6 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll int n, k, i, ar[100005], ans;
int main() {
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
for (i = 0; i < n - k; i++)
ans += ar[i];
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll int n, k, i, ar[200005], ans;
int main() {
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
for (i = 0; i < n - k; i++)
ans += ar[i];
cout << ans;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long> hn(n);
rep(i, n) { cin >> hn[i]; }
sort(hn.begin(), hn.end());
reverse(hn.begin(), hn.end());
long sum = 0;
rep(i, k) { hn[i] = 0; }
rep(i, n) { sum += hn[i]; }
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
if (n <= k) {
cout << 0;
return 0;
}
vector<long> hn(n);
rep(i, n) { cin >> hn[i]; }
sort(hn.begin(), hn.end());
reverse(hn.begin(), hn.end());
long sum = 0;
rep(i, k) { hn[i] = 0; }
rep(i, n) { sum += hn[i]; }
cout << sum;
}
| insert | 7 | 7 | 7 | 11 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
void merge_sort(int array[], int left, int right) {
int i, j, k, mid;
int work[10];
if (left < right) {
mid = (left + right) / 2;
merge_sort(array, left, mid);
merge_sort(array, mid + 1, right);
for (i = mid; i >= left; i--)
work[i] = array[i];
for (j = mid + 1; j <= right; j++)
work[right - (j - (mid + 1))] = array[j];
i = left;
j = right;
for (k = left; k <= right; k++) {
if (work[i] < work[j]) {
array[k] = work[i++];
} else {
array[k] = work[j--];
}
}
}
}
int main(void) {
int n, k;
int h[200010];
int i;
ll ans = 0;
cin >> n >> k;
rep(i, n) { cin >> h[i]; }
merge_sort(h, 0, n - 1);
for (i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
void merge_sort(int array[], int left, int right) {
int i, j, k, mid;
int work[200010];
if (left < right) {
mid = (left + right) / 2;
merge_sort(array, left, mid);
merge_sort(array, mid + 1, right);
for (i = mid; i >= left; i--)
work[i] = array[i];
for (j = mid + 1; j <= right; j++)
work[right - (j - (mid + 1))] = array[j];
i = left;
j = right;
for (k = left; k <= right; k++) {
if (work[i] < work[j]) {
array[k] = work[i++];
} else {
array[k] = work[j--];
}
}
}
}
int main(void) {
int n, k;
int h[200010];
int i;
ll ans = 0;
cin >> n >> k;
rep(i, n) { cin >> h[i]; }
merge_sort(h, 0, n - 1);
for (i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int H[20010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
if (N <= K)
cout << 0 << endl;
else {
sort(H, H + N);
long ans = 0;
for (int i = 0; i < (N - K); i++)
ans += H[i];
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int H[200010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
if (N <= K)
cout << 0 << endl;
else {
sort(H, H + N);
long ans = 0;
for (int i = 0; i < (N - K); i++)
ans += H[i];
cout << ans << endl;
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// input
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__); // __VA_ARGS__可変引数マクロ
template <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) { \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T> void MACRO_VEC_ROW_Init(int n, T &t) { t.resize(n); }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &...rest) {
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T> void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &...rest) {
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
// output
template <typename T> void MACRO_OUT(const T t) { std::cout << t; }
template <typename First, typename... Rest>
void MACRO_OUT(const First first, const Rest... rest) {
std::cout << first << " ";
MACRO_OUT(rest...);
}
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) \
std::cout << std::fixed << std::setprecision(n) \
<< (dist); // std::fixed 浮動小数点の書式 / setprecision
// 浮動小数点数を出力する精度を設定する。
#define SOUT(n, c, dist) std::cout << std::setw(n) << std::setfill(c) << (dist);
#define EOUT(...) \
{ \
OUT(__VA_ARGS__) BR; \
exit(0); \
}
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define SPBR(w, n) std::cout << (w + 1 == n ? '\n' : ' ');
#define ENDL std::cout << std::endl;
#define FLUSH std::cout << std::flush;
#define SHOW(dist) \
{ std::cerr << #dist << "\t: " << (dist) << "\n"; }
#define SHOWVECTOR(v) \
{ \
std::cerr << #v << "\t: "; \
for (const auto &xxx : v) { \
std::cerr << xxx << " "; \
} \
std::cerr << "\n"; \
}
#define SHOWVECTOR2(v) \
{ \
std::cerr << #v << "\t:\n"; \
for (const auto &xxx : v) { \
for (const auto &yyy : xxx) { \
std::cerr << yyy << " "; \
} \
std::cerr << "\n"; \
} \
}
#define SHOWQUEUE(a) \
{ \
auto tmp(a); \
std::cerr << #a << "\t: "; \
while (!tmp.empty()) { \
std::cerr << tmp.front() << " "; \
tmp.pop(); \
} \
std::cerr << "\n"; \
}
#define SHOWSTACK(a) \
{ \
auto tmp(a); \
std::cerr << #a << "\t: "; \
while (!tmp.empty()) { \
std::cerr << tmp.top() << " "; \
tmp.pop(); \
} \
std::cerr << "\n"; \
}
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
// utility
#define ALL(a) (a).begin(), (a).end()
#define FOR(w, a, n) for (int w = (a); w < (n); ++w)
#define RFOR(w, a, n) for (int w = (n)-1; w >= (a); --w)
#define REP(w, n) for (int w = 0; w < int(n); ++w)
#define RREP(w, n) for (int w = int(n) - 1; w >= 0; --w)
#define IN(a, x, b) (a <= x && x < b)
template <class T> inline T CHMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T CHMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
#define PB push_back // 配列の最後にappendする
#define MP make_pair
#define FI first
#define SE second
// test
template <class T> using V = std::vector<T>;
template <class T> using VV = V<V<T>>;
// template<typename S, typename T>
// std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
// os << "(" << p.first << ", " << p.second << ")"; return os;
// }
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double eps = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N> void FILL(T (&a)[N], const T &val) {
for (auto &x : a)
x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T &val) {
for (auto &b : a)
FILL(b, val);
}
template <class T> void FILL(std::vector<T> &a, const T &val) {
for (auto &x : a)
x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>> &a, const T &val) {
for (auto &b : a)
FILL(b, val);
}
// ------------>8------------------------------------->8------------
// typedef pair<int, int> pii;
// typedef pair<ll, int> pli;
// typedef pair<ll, ll> pll;
// typedef vector<int> veci;
// typedef vector<long long> vecl;
signed main() {
INIT;
VAR(ull, n, k);
VEC(ull, h, n);
sort(ALL(h));
REP(i, k) if (n - 1 - i >= 0) h[n - 1 - i] = 0;
ull acc = accumulate(ALL(h), 0LL);
OUT(acc);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// input
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__); // __VA_ARGS__可変引数マクロ
template <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) { \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T> void MACRO_VEC_ROW_Init(int n, T &t) { t.resize(n); }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &...rest) {
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T> void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &...rest) {
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
// output
template <typename T> void MACRO_OUT(const T t) { std::cout << t; }
template <typename First, typename... Rest>
void MACRO_OUT(const First first, const Rest... rest) {
std::cout << first << " ";
MACRO_OUT(rest...);
}
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) \
std::cout << std::fixed << std::setprecision(n) \
<< (dist); // std::fixed 浮動小数点の書式 / setprecision
// 浮動小数点数を出力する精度を設定する。
#define SOUT(n, c, dist) std::cout << std::setw(n) << std::setfill(c) << (dist);
#define EOUT(...) \
{ \
OUT(__VA_ARGS__) BR; \
exit(0); \
}
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define SPBR(w, n) std::cout << (w + 1 == n ? '\n' : ' ');
#define ENDL std::cout << std::endl;
#define FLUSH std::cout << std::flush;
#define SHOW(dist) \
{ std::cerr << #dist << "\t: " << (dist) << "\n"; }
#define SHOWVECTOR(v) \
{ \
std::cerr << #v << "\t: "; \
for (const auto &xxx : v) { \
std::cerr << xxx << " "; \
} \
std::cerr << "\n"; \
}
#define SHOWVECTOR2(v) \
{ \
std::cerr << #v << "\t:\n"; \
for (const auto &xxx : v) { \
for (const auto &yyy : xxx) { \
std::cerr << yyy << " "; \
} \
std::cerr << "\n"; \
} \
}
#define SHOWQUEUE(a) \
{ \
auto tmp(a); \
std::cerr << #a << "\t: "; \
while (!tmp.empty()) { \
std::cerr << tmp.front() << " "; \
tmp.pop(); \
} \
std::cerr << "\n"; \
}
#define SHOWSTACK(a) \
{ \
auto tmp(a); \
std::cerr << #a << "\t: "; \
while (!tmp.empty()) { \
std::cerr << tmp.top() << " "; \
tmp.pop(); \
} \
std::cerr << "\n"; \
}
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
// utility
#define ALL(a) (a).begin(), (a).end()
#define FOR(w, a, n) for (int w = (a); w < (n); ++w)
#define RFOR(w, a, n) for (int w = (n)-1; w >= (a); --w)
#define REP(w, n) for (int w = 0; w < int(n); ++w)
#define RREP(w, n) for (int w = int(n) - 1; w >= 0; --w)
#define IN(a, x, b) (a <= x && x < b)
template <class T> inline T CHMAX(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <class T> inline T CHMIN(T &a, const T b) {
return a = (a > b) ? b : a;
}
#define PB push_back // 配列の最後にappendする
#define MP make_pair
#define FI first
#define SE second
// test
template <class T> using V = std::vector<T>;
template <class T> using VV = V<V<T>>;
// template<typename S, typename T>
// std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
// os << "(" << p.first << ", " << p.second << ")"; return os;
// }
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double eps = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N> void FILL(T (&a)[N], const T &val) {
for (auto &x : a)
x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T &val) {
for (auto &b : a)
FILL(b, val);
}
template <class T> void FILL(std::vector<T> &a, const T &val) {
for (auto &x : a)
x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>> &a, const T &val) {
for (auto &b : a)
FILL(b, val);
}
// ------------>8------------------------------------->8------------
// typedef pair<int, int> pii;
// typedef pair<ll, int> pli;
// typedef pair<ll, ll> pll;
// typedef vector<int> veci;
// typedef vector<long long> vecl;
signed main() {
INIT;
VAR(ull, n, k);
VEC(ull, h, n);
sort(ALL(h));
REP(i, k) {
ll pos = n - 1 - i;
if (pos >= 0) {
h[pos] = 0;
}
}
ull acc = accumulate(ALL(h), 0LL);
OUT(acc);
return 0;
}
| replace | 186 | 187 | 186 | 192 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
using ll = long long;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<ll>());
for (int i = 0; i < k; ++i)
h[i] = 0;
cout << accumulate(h, h + n, 0LL) << '\n';
return (0);
}
| #include <bits/stdc++.h>
#include <numeric>
using namespace std;
using ll = long long;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<ll>());
for (int i = 0; i < min(k, n); ++i)
h[i] = 0;
cout << accumulate(h, h + n, 0LL) << '\n';
return (0);
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
// #include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef long long int ll;
// define
#define INF 1e9
#define NUM 1000000007
#define all(x) begin(x), end(x)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(all(h));
reverse(all(h));
ll ans = 0;
for (int i = 0; i < k; i++) {
h[i] = 0;
}
rep(i, n) { ans += h[i]; }
cout << ans << endl;
}
| // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
// #include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef long long int ll;
// define
#define INF 1e9
#define NUM 1000000007
#define all(x) begin(x), end(x)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(all(h));
reverse(all(h));
ll ans = 0;
if (k > n)
k = n;
for (int i = 0; i < k; i++) {
h[i] = 0;
}
rep(i, n) { ans += h[i]; }
cout << ans << endl;
}
| insert | 40 | 40 | 40 | 42 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<int, int> P;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<string, int>> vpsi;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, k;
cin >> n >> k;
vi h(n);
ll sum = 0;
rep(i, n) {
cin >> h[i];
sum += h[i];
}
Rort(h);
rep(i, k) { sum -= h[i]; }
fin(sum);
//////////////////////////////////////////////////////
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<int, int> P;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<string, int>> vpsi;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, k;
cin >> n >> k;
vi h(n);
ll sum = 0;
rep(i, n) {
cin >> h[i];
sum += h[i];
}
if (n <= k) {
fin(0);
return 0;
}
Rort(h);
rep(i, k) { sum -= h[i]; }
fin(sum);
//////////////////////////////////////////////////////
return 0;
} | insert | 72 | 72 | 72 | 76 | 0 | |
p02785 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
sort(all(H));
reverse(all(H));
for (int i = 0; i < K; i++) {
if (i > N)
break;
H[i] = 0;
}
ll sum = 0;
for (int h : H)
sum += h;
cout << sum << endl;
}
| #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
sort(all(H));
reverse(all(H));
for (int i = 0; i < K; i++) {
if (i >= N)
break;
H[i] = 0;
}
ll sum = 0;
for (int h : H)
sum += h;
cout << sum << endl;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> data(n);
REP(i, n) cin >> data[i];
ll sum = 0;
sort(ALL(data), greater<int>());
REP(i, k) { data[i] = 0; }
REP(i, n) { sum += data[i]; }
cout << sum << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> data(n);
REP(i, n) cin >> data[i];
ll sum = 0;
sort(ALL(data), greater<int>());
REP(i, min(k, n)) { data[i] = 0; }
REP(i, n) { sum += data[i]; }
cout << sum << endl;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int K;
cin >> K;
vector<long long int> H;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
long long int ans = 0;
for (int i = K; i < N; i++) {
ans = ans + H[i];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int K;
cin >> K;
vector<long long int> H(N, 0);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
long long int ans = 0;
for (int i = K; i < N; i++) {
ans = ans + H[i];
}
cout << ans;
return 0;
} | replace | 7 | 8 | 7 | 8 | -11 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> h;
for (int i = 0; i < n; ++i) {
long t;
cin >> t;
h.push_back(t);
}
sort(h.begin(), h.end(), greater<long>());
for (int i = 0; i < k; ++i) {
h[i] = 0;
}
cout << accumulate(h.begin(), h.end(), 0L) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> h;
for (int i = 0; i < n; ++i) {
long t;
cin >> t;
h.push_back(t);
}
sort(h.begin(), h.end(), greater<long>());
for (int i = 0; i < min(k, n); ++i) {
h[i] = 0;
}
cout << accumulate(h.begin(), h.end(), 0L) << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
ll ans = 0;
for (int i = 0; i < k || i < n; ++i)
h[i] = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
ll ans = 0;
for (int i = 0; i < k && i < n; ++i)
h[i] = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p02785 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
//
#include "bits/stdc++.h"
using namespace std;
#define INF (1LL << 60)
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl
#define SP << " " <<
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
#define MSB(x) (63 - __builtin_clzll(x))
#define pcnt(x) (__builtin_popcountll(x))
#define parity(i, j) (i & (1LL << j))
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, n;
cin >> n >> h;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
REP(i, n - 1) ans += (a[i] + h - 1) / h;
cout << ans << endl;
return 0;
}
| // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
//
#include "bits/stdc++.h"
using namespace std;
#define INF (1LL << 60)
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl
#define SP << " " <<
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
#define MSB(x) (63 - __builtin_clzll(x))
#define pcnt(x) (__builtin_popcountll(x))
#define parity(i, j) (i & (1LL << j))
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, n;
cin >> n >> h;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
REP(i, n - h) ans += a[i];
cout << ans << endl;
return 0;
}
| replace | 69 | 70 | 69 | 70 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (i) <= (k); (i)++)
#define rap(i, j, k) for (ltype(i) = (j); (i) < (k); (i)++)
#define per(i, j, k) for (ltype(i) = (j); (i) >= (k); (i)--)
#define pii pair<int, int>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define fastio ios::sync_with_stdio(false)
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
int n, k, a[100005];
ll ans;
int main() {
scanf("%d%d", &n, &k);
rep(i, 1, n) scanf("%d", a + i);
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
rep(i, k + 1, n) ans += a[i];
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (i) <= (k); (i)++)
#define rap(i, j, k) for (ltype(i) = (j); (i) < (k); (i)++)
#define per(i, j, k) for (ltype(i) = (j); (i) >= (k); (i)--)
#define pii pair<int, int>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define fastio ios::sync_with_stdio(false)
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
int n, k, a[200005];
ll ans;
int main() {
scanf("%d%d", &n, &k);
rep(i, 1, n) scanf("%d", a + i);
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
rep(i, k + 1, n) ans += a[i];
printf("%lld\n", ans);
return 0;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lol long long
using namespace std;
lol m[100000];
int main() {
lol a, b, c, ans = 0;
string s;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> m[i];
}
sort(m, m + a, greater<lol>());
for (int i = b; i < a; i++) {
ans += m[i];
}
cout << ans << "\n";
return (0);
}
| #include <bits/stdc++.h>
#define lol long long
using namespace std;
lol m[200005];
int main() {
lol a, b, c, ans = 0;
string s;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> m[i];
}
sort(m, m + a, greater<lol>());
for (int i = b; i < a; i++) {
ans += m[i];
}
cout << ans << "\n";
return (0);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
cout << accumulate(h.begin(), h.begin() + n - k, 0LL) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
ll sum = 0;
rep(i, n - k) sum += h[i];
cout << sum << endl;
return 0;
}
| replace | 12 | 13 | 12 | 15 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.