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 <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// 素因数分解
typedef pair<long long, long long> P;
vector<P> prime_factorize(long long n) {
vector<P> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// 因数分解
long long gcd(long long x, long long y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
const int MOD = 1000000007;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> H(n);
rep(i, n) { cin >> H[i]; }
sort(H.begin(), H.end());
for (ll i = 0; i < k; i++) {
H[n - 1 - i] = 0;
}
ll ans = 0;
rep(i, n) { ans += H[i]; }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// 素因数分解
typedef pair<long long, long long> P;
vector<P> prime_factorize(long long n) {
vector<P> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// 因数分解
long long gcd(long long x, long long y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
const int MOD = 1000000007;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> H(n);
rep(i, n) { cin >> H[i]; }
sort(H.begin(), H.end());
for (ll i = 0; i < k && i <= n - 1; i++) {
H[n - 1 - i] = 0;
}
ll ans = 0;
rep(i, n) { ans += H[i]; }
cout << ans << endl;
return 0;
} | replace | 71 | 72 | 71 | 72 | 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 REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<long long int> H(N + 1);
rep(i, N) { cin >> H[i]; }
sort(H.begin(), H.end());
long long int atksum = 0;
for (vector<long long int>::iterator itr = H.begin(), e = H.end();
itr != e - K; itr++) {
atksum += *itr;
}
cout << atksum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<long long int> H(N + 1);
rep(i, N) { cin >> H[i]; }
sort(H.begin(), H.end());
long long int atksum = 0;
for (int i = 0; i < N - K + 1; i++) {
atksum += H[i];
}
cout << atksum << endl;
} | replace | 16 | 19 | 16 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll int arr[100005];
int main() {
ll int j, i, m, n, sum = 0;
cin >> m >> n;
if (n >= m) {
while (m--)
cin >> n;
cout << 0 << endl;
exit(0);
}
for (i = 0; i < m; i++) {
cin >> arr[i];
sum += arr[i];
}
if (!n) {
cout << sum << endl;
exit(0);
}
sort(arr, arr + i);
for (j = 0; j <= n; j++, i--)
sum -= arr[i];
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll int arr[200005];
int main() {
ll int j, i, m, n, sum = 0;
cin >> m >> n;
if (n >= m) {
while (m--)
cin >> n;
cout << 0 << endl;
exit(0);
}
for (i = 0; i < m; i++) {
cin >> arr[i];
sum += arr[i];
}
if (!n) {
cout << sum << endl;
exit(0);
}
sort(arr, arr + i);
for (j = 0; j <= n; j++, i--)
sum -= arr[i];
cout << sum << endl;
return 0;
}
| replace | 3 | 4 | 3 | 5 | 0 | |
p02785 | C++ | Runtime Error | // Yazar: Mehmet Kutay Bozkurt
// Auther: Mehmet Kutay bozkurt
// #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int lo;
#define pb push_back
#define st first
#define nd second
lo a, b, c, d, e, n, m, x, y, z, a1[100005], a2[100005], k, t;
char c1, c2, c3, c4;
string s1, s2, s3, s4, den[3];
bool av = false;
map<char, lo> mp;
vector<lo> v;
vector<lo> v1;
int main() {
// freopen("gir.gir","r",stdin);
// freopen("cik.cik","w",stdout);
cin >> n >> m;
for (lo i = 0; i < n; i++) {
cin >> a1[i];
}
x = 0;
sort(a1, a1 + n);
for (lo i = 0; i < n - m; i++) {
x += a1[i];
}
cout << x << endl;
return 0;
} | // Yazar: Mehmet Kutay Bozkurt
// Auther: Mehmet Kutay bozkurt
// #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int lo;
#define pb push_back
#define st first
#define nd second
lo a, b, c, d, e, n, m, x, y, z, a1[500005], a2[100005], k, t;
char c1, c2, c3, c4;
string s1, s2, s3, s4, den[3];
bool av = false;
map<char, lo> mp;
vector<lo> v;
vector<lo> v1;
int main() {
// freopen("gir.gir","r",stdin);
// freopen("cik.cik","w",stdout);
cin >> n >> m;
for (lo i = 0; i < n; i++) {
cin >> a1[i];
}
x = 0;
sort(a1, a1 + n);
for (lo i = 0; i < n - m; i++) {
x += a1[i];
}
cout << x << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5;
int n, m, val[N];
ll sum;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> val[i];
sort(val + 1, val + 1 + n);
for (int i = 1; i <= n - m; ++i)
sum += val[i];
cout << sum;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int n, m, val[N];
ll sum;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> val[i];
sort(val + 1, val + 1 + n);
for (int i = 1; i <= n - m; ++i)
sum += val[i];
cout << sum;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#ifdef XVENOM
#define errp(...) fprintf(stderr, __VA_ARGS__)
#define dbg(...) errp("[%s]: ", #__VA_ARGS__), dbg_str(__VA_ARGS__)
#else
#define errp(...)
#define dbg(...)
#endif
template <typename U, typename V> string to_string(pair<U, V>);
string to_string(const string &e_) { return "\"" + e_ + "\""; }
string to_string(char e_) { return "\'" + string(1, e_) + "\'"; }
string to_string(bool e_) { return e_ ? "true" : "false"; }
template <typename T> string to_string(T e_) {
string s_ = "[ ";
for (const auto &x_ : e_)
s_ += to_string(x_) + " ";
return s_ + "]";
}
template <typename U, typename V> string to_string(pair<U, V> e_) {
return "(" + to_string(e_.first) + ", " + to_string(e_.second) + ")";
}
void dbg_str() { errp(" \n"); }
template <typename U, typename... V> void dbg_str(U u, V... v) {
errp(" %s", to_string(u).c_str());
dbg_str(v...);
}
/* --- */
const int N = 100010;
int a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
/* --- */
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll ans = 0;
for (int i = 0; i < n - k; i++)
ans += a[i];
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#ifdef XVENOM
#define errp(...) fprintf(stderr, __VA_ARGS__)
#define dbg(...) errp("[%s]: ", #__VA_ARGS__), dbg_str(__VA_ARGS__)
#else
#define errp(...)
#define dbg(...)
#endif
template <typename U, typename V> string to_string(pair<U, V>);
string to_string(const string &e_) { return "\"" + e_ + "\""; }
string to_string(char e_) { return "\'" + string(1, e_) + "\'"; }
string to_string(bool e_) { return e_ ? "true" : "false"; }
template <typename T> string to_string(T e_) {
string s_ = "[ ";
for (const auto &x_ : e_)
s_ += to_string(x_) + " ";
return s_ + "]";
}
template <typename U, typename V> string to_string(pair<U, V> e_) {
return "(" + to_string(e_.first) + ", " + to_string(e_.second) + ")";
}
void dbg_str() { errp(" \n"); }
template <typename U, typename... V> void dbg_str(U u, V... v) {
errp(" %s", to_string(u).c_str());
dbg_str(v...);
}
/* --- */
const int N = 200010;
ll a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
/* --- */
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll ans = 0;
for (int i = 0; i < n - k; i++)
ans += a[i];
cout << ans;
} | replace | 30 | 32 | 30 | 32 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
char mem[114514];
char t[114514];
char c[114514];
string s[114514];
int a[114514], b[114514];
signed main() {
ic(n) ic(x) int sum = 0;
rep(0, i, n) cin >> a[i];
sort(a, a + n);
rep(0, i, n - x) sum += a[i];
c(sum)
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
char mem[114514];
char t[114514];
char c[114514];
string s[114514];
int a[214514], b[114514];
signed main() {
ic(n) ic(x) int sum = 0;
rep(0, i, n) cin >> a[i];
sort(a, a + n);
rep(0, i, n - x) sum += a[i];
c(sum)
}
| replace | 60 | 61 | 60 | 61 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <iostream>
using I = long long int;
using namespace std;
int H[30001];
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
I n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> H[i];
sort(H, H + n);
// for(int i = 0; i < n; ++ i) cout << H[i] << " ";
I tot = 0;
const int start = n - (k + 1); // cout << "start: " << start << "\n";
for (int i = start; i >= 0; i--) {
tot += H[i];
}
cout << tot;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <iostream>
using I = long long int;
using namespace std;
int H[300001];
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
I n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> H[i];
sort(H, H + n);
// for(int i = 0; i < n; ++ i) cout << H[i] << " ";
I tot = 0;
const int start = n - (k + 1); // cout << "start: " << start << "\n";
for (int i = start; i >= 0; i--) {
tot += H[i];
}
cout << tot;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
ll H[200010];
ll attack_cnt = 0;
for (int i = 0; i < N; ++i)
cin >> H[i];
for (int i = 0; i < N - 1; ++i) {
for (int j = N - 1; j > i; --j) {
if (H[i] > H[j]) {
int tmp = H[i];
H[i] = H[j];
H[j] = tmp;
}
}
}
for (int i = 0; i < N - K; ++i) {
attack_cnt += H[i];
}
cout << attack_cnt << endl;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
ll H[200010];
ll attack_cnt = 0;
for (int i = 0; i < N; ++i)
cin >> H[i];
stable_sort(H, H + N);
for (int i = 0; i < N - K; ++i) {
attack_cnt += H[i];
}
cout << attack_cnt << endl;
}
| replace | 13 | 22 | 13 | 14 | TLE | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
const int maxn = 1e5 + 5;
ll a[maxn];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
ll sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
const int maxn = 2e5 + 5;
ll a[maxn];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
ll sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int n, k;
long long ans;
int a[20005];
int cmp(int a, int b) { return a > b; }
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
if (i > k)
ans += a[i];
}
printf("%lld", ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int n, k;
long long ans;
int a[200005];
int cmp(int a, int b) { return a > b; }
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
if (i > k)
ans += a[i];
}
printf("%lld", ans);
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<long long int> h(n);
rep(i, n) cin >> h[i];
if (n <= k)
cout << 0 << endl;
else if (k == 0)
cout << accumulate(h.begin(), h.end(), 0LL) << endl;
else {
rep(i, k) {
auto iter = max_element(h.begin(), h.end());
h.erase(iter);
}
cout << accumulate(h.begin(), h.end(), 0LL) << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<long long int> h(n);
rep(i, n) cin >> h[i];
if (n <= k)
cout << 0 << endl;
else if (k == 0)
cout << accumulate(h.begin(), h.end(), 0LL) << endl;
else {
sort(h.begin(), h.end(), greater<int>());
h.erase(h.begin(), h.begin() + k);
cout << accumulate(h.begin(), h.end(), 0LL) << endl;
}
} | replace | 30 | 34 | 30 | 32 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
using namespace std;
int n, k, a[100001];
ll cnt;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k; i++) {
cnt += a[i];
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
using namespace std;
int n, k, a[1000001];
ll cnt;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k; i++) {
cnt += a[i];
}
cout << cnt;
return 0;
} | replace | 7 | 8 | 7 | 8 | 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 rep1(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll sum = 0;
vector<ll> H(n);
rep(i, n) {
cin >> H[i];
sum += H[i];
}
sort(H.rbegin(), H.rend());
rep(i, k) { sum -= H[i]; }
if (sum <= 0)
cout << 0 << endl;
else
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll sum = 0;
vector<ll> H(n);
rep(i, n) {
cin >> H[i];
sum += H[i];
}
sort(H.rbegin(), H.rend());
rep(i, k) {
sum -= H[i];
if (sum < 0)
break;
}
if (sum <= 0)
cout << 0 << endl;
else
cout << sum << endl;
} | replace | 18 | 19 | 18 | 23 | 0 | |
p02785 | C++ | Runtime Error | ///**Bismillahir Rahmanir Rahim.**
#include <bits/stdc++.h>
#define int long long int
#define clr(a, v) memset(a, v, sizeof a)
#define all(v) v.begin(), v.end()
#define ast(v) sort(all(v))
#define sfs(s) scanf("%s", s)
#define sf(n) scanf("%lld", &n)
#define sff(n, m) scanf("%lld %lld", &n, &m)
#define dst(v) sort(all(v), greater<int>())
#define sfff(n, m, o) scanf("%lld %lld %lld", &n, &m, &o)
#define PP(n, m) cout << n << " " << m << "\n"
#define PPP(a, b, c) cout << a << " " << b << " " << c << "\n"
#define MX(a) *max_element(all(a))
#define MI(a) *min_element(all(a))
#define SUM(a) accumulate(all(a), 0)
#define I(n) cin >> n
#define II(n, m) cin >> n >> m
#define III(a, b, c) cin >> a >> b >> c
#define MIN(a, b, c) min(a, min(b, c))
#define MAX(a, b, c) max(a, max(b, c))
#define MID(b, e) (b + (e - b) / 2)
#define CAS(a) cout << "Case " << a << ":"
#define pf(n) printf("%lld", n)
#define pff(n, m) printf("%lld %lld\n", n, m)
#define prln(n) cout << n << "\n"
#define P(n) cout << n
#define debug cout << " debug\n"
#define yes cout << "Yes\n"
#define no cout << "No\n"
#define minus1 cout << "-1\n"
#define zero cout << "0\n"
#define sp cout << " "
#define nl cout << "\n"
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define S second
#define F first
using namespace std;
const int N = 2e5 + 50;
const int mod = 1e9 + 7;
bool is_prime[N + 50];
// cout<<fixed<<showpoint;
// cout<<setprecision(12)<<res<<"\n";
vector<int> prime, primeFactor;
int digit(int n) { return log10(n) + 1; }
int bit_on(int n, int pos) { return n = n | (1 << pos); }
int bit_off(int n, int pos) { return n = n & ~(1 << pos); }
bool check(int n, int pos) { return (bool)(n & (1 << pos)); }
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
string toString(int n) {
stringstream ss;
ss << n;
string s;
ss >> s;
return s;
}
int toInt(string s) {
stringstream ss;
ss << s;
int n;
ss >> n;
return n;
}
bool isVowel(char ch) {
ch = tolower(ch);
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')
return true;
return false;
}
bool isConst(char ch) {
if (isalpha(ch) && !isVowel(ch))
return true;
return false;
}
double dis(double x, double y, double x2, double y2) {
double res = sqrt(pow(x - x2, 2) + pow(y - y2, 2));
return res;
}
void sieve() {
prime.push_back(2);
for (int i = 4; i <= N; i += 2)
is_prime[i] = 1;
for (int i = 3; i < N; i += 2) {
if (is_prime[i] == 0) {
prime.push_back(i);
for (int j = i * i; j < N; j += (i * 2))
is_prime[j] = 1;
}
}
}
bool isPrime(int n) {
if (n == 1)
return false;
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i * i <= n; i += 2)
if (n % i == 0)
return false;
return true;
}
void primeFac(int n) {
int tmp = sqrt(n);
for (int i = 0; prime[i] <= tmp; i++) {
if (n % prime[i] == 0) {
while (n % prime[i] == 0) {
n /= prime[i];
primeFactor.pb(prime[i]);
}
}
}
if (n > 1)
primeFactor.pb(n);
}
int SOD(int n) {
int sum = 1;
for (int i = 0; prime[i] <= n; i++) {
if (n % prime[i] == 0) {
int cnt = 1;
while (n % prime[i] == 0) {
n /= prime[i];
cnt++;
}
sum *= (pow(prime[i], cnt) - 1) / (prime[i] - 1);
}
}
return sum;
}
int NOD(int n) {
int till = sqrt(n + 1);
int p, divisor = 1;
for (int i = 0; prime[i] <= till; i++) {
if (n % prime[i] == 0) {
p = 1;
while (n % prime[i] == 0) {
n /= prime[i];
p++;
}
till = sqrt(n);
divisor *= p;
}
}
if (n > 1)
divisor *= 2;
return divisor;
}
bool isDigit(char ch) {
if (ch >= 48 && ch <= 57)
return true;
else
return false;
}
string Upper(string s) {
transform(all(s), s.begin(), ::toupper);
return s;
}
string Lower(string s) {
transform(all(s), s.begin(), ::tolower);
return s;
}
int fx[] = {0, 0, 1, -1}; // grid visit
int fy[] = {1, -1, 0, 0};
// Template end
//-------------------******Alhamdulillah******--------------------//
int32_t main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
fast();
int tc = 1;
for (int T = 1; T <= tc; T++) {
int h, n;
cin >> h >> n;
vector<int> v(h);
for (int i = 0; i < h; i++) {
cin >> v[i];
}
dst(v);
for (int i = 0; i < n; i++) {
v[i] = 0;
}
int ans = 0;
for (int i = 0; i < h; i++) {
if (v[i])
ans += v[i];
}
cout << ans << "\n";
}
return 0;
}
//--------------------******Alhamdulillah******-------------------//
| ///**Bismillahir Rahmanir Rahim.**
#include <bits/stdc++.h>
#define int long long int
#define clr(a, v) memset(a, v, sizeof a)
#define all(v) v.begin(), v.end()
#define ast(v) sort(all(v))
#define sfs(s) scanf("%s", s)
#define sf(n) scanf("%lld", &n)
#define sff(n, m) scanf("%lld %lld", &n, &m)
#define dst(v) sort(all(v), greater<int>())
#define sfff(n, m, o) scanf("%lld %lld %lld", &n, &m, &o)
#define PP(n, m) cout << n << " " << m << "\n"
#define PPP(a, b, c) cout << a << " " << b << " " << c << "\n"
#define MX(a) *max_element(all(a))
#define MI(a) *min_element(all(a))
#define SUM(a) accumulate(all(a), 0)
#define I(n) cin >> n
#define II(n, m) cin >> n >> m
#define III(a, b, c) cin >> a >> b >> c
#define MIN(a, b, c) min(a, min(b, c))
#define MAX(a, b, c) max(a, max(b, c))
#define MID(b, e) (b + (e - b) / 2)
#define CAS(a) cout << "Case " << a << ":"
#define pf(n) printf("%lld", n)
#define pff(n, m) printf("%lld %lld\n", n, m)
#define prln(n) cout << n << "\n"
#define P(n) cout << n
#define debug cout << " debug\n"
#define yes cout << "Yes\n"
#define no cout << "No\n"
#define minus1 cout << "-1\n"
#define zero cout << "0\n"
#define sp cout << " "
#define nl cout << "\n"
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define S second
#define F first
using namespace std;
const int N = 2e5 + 50;
const int mod = 1e9 + 7;
bool is_prime[N + 50];
// cout<<fixed<<showpoint;
// cout<<setprecision(12)<<res<<"\n";
vector<int> prime, primeFactor;
int digit(int n) { return log10(n) + 1; }
int bit_on(int n, int pos) { return n = n | (1 << pos); }
int bit_off(int n, int pos) { return n = n & ~(1 << pos); }
bool check(int n, int pos) { return (bool)(n & (1 << pos)); }
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
string toString(int n) {
stringstream ss;
ss << n;
string s;
ss >> s;
return s;
}
int toInt(string s) {
stringstream ss;
ss << s;
int n;
ss >> n;
return n;
}
bool isVowel(char ch) {
ch = tolower(ch);
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u')
return true;
return false;
}
bool isConst(char ch) {
if (isalpha(ch) && !isVowel(ch))
return true;
return false;
}
double dis(double x, double y, double x2, double y2) {
double res = sqrt(pow(x - x2, 2) + pow(y - y2, 2));
return res;
}
void sieve() {
prime.push_back(2);
for (int i = 4; i <= N; i += 2)
is_prime[i] = 1;
for (int i = 3; i < N; i += 2) {
if (is_prime[i] == 0) {
prime.push_back(i);
for (int j = i * i; j < N; j += (i * 2))
is_prime[j] = 1;
}
}
}
bool isPrime(int n) {
if (n == 1)
return false;
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i * i <= n; i += 2)
if (n % i == 0)
return false;
return true;
}
void primeFac(int n) {
int tmp = sqrt(n);
for (int i = 0; prime[i] <= tmp; i++) {
if (n % prime[i] == 0) {
while (n % prime[i] == 0) {
n /= prime[i];
primeFactor.pb(prime[i]);
}
}
}
if (n > 1)
primeFactor.pb(n);
}
int SOD(int n) {
int sum = 1;
for (int i = 0; prime[i] <= n; i++) {
if (n % prime[i] == 0) {
int cnt = 1;
while (n % prime[i] == 0) {
n /= prime[i];
cnt++;
}
sum *= (pow(prime[i], cnt) - 1) / (prime[i] - 1);
}
}
return sum;
}
int NOD(int n) {
int till = sqrt(n + 1);
int p, divisor = 1;
for (int i = 0; prime[i] <= till; i++) {
if (n % prime[i] == 0) {
p = 1;
while (n % prime[i] == 0) {
n /= prime[i];
p++;
}
till = sqrt(n);
divisor *= p;
}
}
if (n > 1)
divisor *= 2;
return divisor;
}
bool isDigit(char ch) {
if (ch >= 48 && ch <= 57)
return true;
else
return false;
}
string Upper(string s) {
transform(all(s), s.begin(), ::toupper);
return s;
}
string Lower(string s) {
transform(all(s), s.begin(), ::tolower);
return s;
}
int fx[] = {0, 0, 1, -1}; // grid visit
int fy[] = {1, -1, 0, 0};
// Template end
//-------------------******Alhamdulillah******--------------------//
int32_t main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
fast();
int tc = 1;
for (int T = 1; T <= tc; T++) {
int h, n;
cin >> h >> n;
vector<int> v(h);
for (int i = 0; i < h; i++) {
cin >> v[i];
}
dst(v);
for (int i = 0; i < min(n, h); i++) {
v[i] = 0;
}
int ans = 0;
for (int i = 0; i < h; i++) {
if (v[i])
ans += v[i];
}
cout << ans << "\n";
}
return 0;
}
//--------------------******Alhamdulillah******-------------------//
| replace | 186 | 187 | 186 | 187 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repX(i, n, x) for (int i = x; i < (int)(n); i++)
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 ans = 0;
rep(i, N) {
if (H[i] > 0) {
ans += H[i];
H[i] = 0;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repX(i, n, x) for (int i = x; i < (int)(n); i++)
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) if (i < N) H[i] = 0;
ll ans = 0;
rep(i, N) {
if (H[i] > 0) {
ans += H[i];
H[i] = 0;
}
}
cout << ans << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | /*
-J+J+JJ+JJ+++++++J++JJ+J++J+J+J+JJJJ+JJ+++++JJ+J+JJJ+J+JJ+JJ++JJ++J+JJ+JJ+JJJJ++J++J+JJ++++JJJ++JJJ+J++J++JJ++++JJJJJ++J++J++++JJJ++++J+JJJ+J+++++++++J+JJ+JJJJJJJJJJJ++JJJJJJJJJJJJJJJJJJJ+J.
d##""H#"TMY"""HBWB"T#"HYHYWMYWMY"WYMMY"TMM""W#"TMYBYMYBMH@T@""B"WTWTY"YY"MBBT#YM"YBTW"YY"UBWW"TH9"B"T@Y"WM"T@W""BB"WBY@W"TBBM"WWB"#"T@"T#"TM"T#"W9""W@4#TM@""""""""""""""""""""""""""""""""M#}
d#HU+.(4, ?&. (S(0,.4,?o?&?Wo?H, ?o3X, .Wn. ?p ?h,>?h,cSO.(. (_.;I<1 >
1%( W Z_.O,( ._`(>(+ .z_.o..a[ dh-(Je.,+`.v_c.>.Cv(!,jf.J .= .= .#!.=.J!
.J!.=.dF M#} d#r_4dn, 7&.?G,
(U(6,.4,?&7,?W,7h, T,Un.`7k, (h.?N,l?h,vSO.<.`1
((O,<`(..w(mHHNa.z.+.+NMMMms`.1d@"7CMb.H@=77MN3dMMMMMN.2/(!((t.C ,^ ,' JY
J!.=` .=.m(k#^ MN} d#r ?XS..?G,-4,
-4J6,.4,7J4,4h,4n.(ojX, (H& .h.,N-i(h.v6G 1..o.agag. >.MY` TNy(MB^.&,.(M[(dM\
j#@(M\ .MEGM$ dNvJ.!J(%.= (` J`.d^.=./` .=-J!?N{` M#} d#MN&. _4Z&..4,.7,
.4J6,.4,4-O-4o(W, </wi 4n. 4,.HJo,h,zQMMBY""7??Mb (M!.HMggMM8MF`(######%(d#
.M#NM#` (#j##` `.#@J.!(J^.'.2 .? .F J!.^`.J!,^ .JM] ` ` M#} d#[ 7Mm, ?wS,
7&.?i.`.4J4,(6,6(G?W,7h..1daJ.?k,.dMB""WMm,JM_ ` MM2M] (M####N(Mb
.WMM###%(MF .###M% `.MSMM\ `.M#@(!JJ'.^.>`.'.J^.>./` .^.= .J~.#\ ` M#} d#@0,
.TMa, .4Z&.jm+ga. 7,3,(1,1gHMN/4gM"??7WMNM% ....dMn,M{
(gQM###NdN,..7"YMM(dMm, ` ?H[dM! d####` `(NW#F JHMI!JJ!(!.^
(`.f`(!,'`.7.?` ,^.W#@ ` M#} d#r 7G,
?TNJ.`.H#"!`_?Hm.(dMMN,(u#) MNMY.&Mm.(M#F`J######K4M} ` J####a(#Mm,
WNmgM#Ne MPW# .M###P `.M##M! .M##!(J~J`,!.> .=.>.? ./~/! .^.V^ Mb ` `
M#} d#Bu,` 7&, ?WmM=`.., ` MMM` M#Mh,Mb`d#E d######Hb d###H###mH[
.+gMM#MY!W##N. dMI####M~ .M1#HH#MM###m-.J###Ngg-H###(v_/ / .!.v!,~(! .!,!
.>.Z^ .JX# `` ` ` MN} d#r 7G, `.7&.M>
.M##aJd### M##MeWN J#t`M##H####N ,M###MY"M#L` 7!` MM-
7"^`.j##-(TMY^.(MHN##"W##HMMTWM####"WM###HDv_>./ (`.=.>.!`.?.!`.?(v^ ./!.(N_
` ` ` ` M#} d#fT-. 71, d@` ,####H###N d###### ,NL
(####MMM#L`(M#MF .M#N ....+##NJ....g####NaJJgHH#####mJJ####L..M##Mt
(##M#F.!.!.~ J',~(`./-? .?(v^ ./`.JgMN_ ` ` ` (WN-..Ja.` ` `
M#} d#m, _7&,` ?1JN,` ?MMH###HM. ,MH##Mt .#N. ?MH#$ .H#e ` `
.d##MHMM#####H#H#H###H###H#H##H#HH######M##H###H###MHgJ#H##M<!,!.!.2.?.!
.~_`./(z^`.?`.jgD`.M: ` j(+HM#"~dMB` MN} d#kXWm.. ?1.
?MN&.. ` ?M##| .THB= `.##k. _`
j###NgJ&M####HH#H#H#HH#H#H#HH##HHH#H#HH##HHHHHHHHHHHHHH#HHHH####H##M#!_
.`,!.~_ .!.! ,<J^`.?`.ud= .Z4N! ?^ (N/^ ` ` MN} d#r
?4xTHa, ?=-.TM#Mp -##b ` g###NJ.
..H#####H####H##H###H#HMMMMM###H#H###H###H#H##H#H##H##H##HH##H#HH##H##Hb_ _
/_~.! __! ,~J! .<..uV^.-Y_(dN` ` dN. ` MN} d#@I..
-7Ov9A..(OdM#M; `.###m.`` ` (##H#H#####HHH#HH#HHHH#HH#H#####p `
?"WM####H#H##H#HH#H#HH#H#H#H#H#H#H#HH#H###% `.!.__ .~_ .~(! .ugMMM:.uN.<-!d@
.M% M#} d#r `_71.. ?WMBW#NJ#@`
`(H##MMmJ..+M#H#H#H#H##H##H##H#####H##H#H###9"`
(TMH###HH##H###H##H#H#H#####H###H##H#H<`(__.`.~.`.~.! .gM@!`d#MYXM?~.(#% ` `
` ` MN} d#MHQ.. _7uM] `?""`
`.M#####H##H#H#H##H#H#HHH#HHH##H#H#H##H#H###Ma.` `
?M##################H##H###H##H####._ _` ..`.~.! .gMY` ` dN_!.(# ` ` ``
` ` M#} d#NQyUWHmJ. dN. ` ` `
.M##HH##H#H#H#H#H##H####HH#H#HH#H#H#HH##H#####Ma.` ` `
MMY^?WMHH#MMHY""""""YHMMH##H##H##` ` _` .! .(MD` ` ` .M].<(M% ` ` (J.
+. M#}
d#r?TUHXgVUWWMNJ....JH##HH#HH#H#HH#H#HHHH#HHH#H#H#H##H##H##H#H#HHH####MNg,.``
`` .-M= ..J"=` _7TM###] ._ ._(#^ ` j#+dWMF
?N,?^.MD ` ` MN} d#b-.
_7TWHAZVWMM######H###H##H#HH#H##H#H#H#H#H#HHH##H##H#########MM######MNa&J(H_..v"!
... ` ?WNJ.`` .d@` ` ` (MSVGMD ` `
-@! ` M#} d#D(._71-.
?7TUkeVHM###H#H##HH#H#HH#HH#H#H#HH#HH##HHHHH#HH#HMMM}(M%.MHMM##H#####M#^
`?=jV"N ` ` ` ` ` ` ` TNe. `` .(M@` ` ` (M^.d#^ ` ` .Y!` ` ` M#}
d#L. ?7+._?1(.. ?7TSdHM####H##H#H#H#H#H#HH#H#H#H#H##H#H####M#`
(!.M#######=(J` ..VM=.., ` ` ..... ` .WN,... J#` `` ` .dMmM9^
! M#} d#HWWX&-.. _?<._?<-..
?7THM#H#H#HH#HH#H#H#HH#H#H#HHH##H#H##H) ` ` ?M###H#^.dnJV"H-,@"!.b `
... ` dN-`?4,` ` XMY"WMM'` ` `(MM##Na.. `` ` ` ` M#}
d#KvCOwZVUXG+-. ?~-.<<-. _?TMH#######HH#H#H#HH#H##HHH#H#HH#N. `
...JH=(M##^ J=` .gMWWMN, w,.-Y=_Ta. d!4, `? ,` ,h.gMN, ` `
`.HD-(7THNa, `` ` ` ` `.. `` ` M#}
d#K+Jv71Jv71OOOZXy+.. _!_.<!-._TMH#H#H#H#HH#H#HH#HH#H#HH#H#H#MVV"=?^.=.?(MD
.d! .X= ` ?N_ `?^` `.J7ND. (h, ` W ` ` `(b_ W_ ` ..+#MMHN+(+z7MN+ `
(MNgNm. ` M#} d#r~?7COOz++?<<+++1zOvOz(..
`_._~(TM########H##H#H#H#H#HH#HHMMI`(_.: {`(d' .f! .=.x . W! `..MHBWMNx
(4&. W `d[ uY` d#WMY` d#"WN<<_(WN, ` ` ` JB! .M= `
M#} d#Ha-... ~?71zz((<<_<<<+<z1+-..
`._TM#H#####H#H##H#H##H####N&~.-(-mVU@``.d! .M#n...dN.7` ` ` .Y! ` (WN,
?UJK .@ .@ ` .Mb ` ` MHWN; .JN;`` ` `,"` vM#` MN}
d#mJv777VUUuJ... ??<1+((<~~:<<;<:-.. _TM##M##H#H##HHH#HH#H##NVY"! .K`
J\ .dMH#######{ <J/ ` dN. .D ` `.h.d^..M#THJ.` ` JMN,.(dN.
.(#"M\ ` ` MN} d#b(.._??<<((+??7TOO&(...
`~?<_____~___..._TMH##H#H##H#H#H#H##! ` d! .F d#MH#H##### `
.M#m....JMp.M{ `(\ ` `.P`.JM#M~.> T4a, .dE..(N~ ` .J"` `
` ` MN} d#mJ...._!??<_.-_<<!~_(<?<<11-...
`__.-.````-TM###H#H#HH#H##N, .t d` H^ W##MM#M^ `` jH##H######N ^ `
X` ` .NM#N#MHJ-,!,_./4a. .JM9<_(dN,` ` `` ` ` ` MN}
d#h((-+7""YYUAgJ-..._~!_---_~~___~<!~-.. ` ` ."MM##H##H#H##M)` ` X(...F
?> .J@! ` .###H###H#### ` .F ` `(###M= .W,^.?./<,TQMb<~~((+M]
.-. M#} d#o. `` ~???<~~-(<?77T71+--...`` ` . ```` `
.TM##H##H###F .PdF_7` ?` ` ``dB=d##H#M##M' d` ` .#W#@!
7L.? (~.>,MF_`` ..M\ ` ` .MF` ` ` MN}
d#f?777"TTCIz++-...... ``````._~<!~~... .TM#####Hb` ,SH: ` `
" ` `?! ?"=!.MM^ ` ``.t ` ` (aY^ ` (b--(.(&MY` ...(MF ` .M} `
MN} d#D<<<<(-..........` `~~??!<!~~_.... `` ` ` ` ` .7MM##N JCM-
` R ..` ` (Y` ` .K` ` .@` ` ,N/(dMY_ ..__~_dN. .M}
` M#} d#NA&&JJ-(-............___~~`_`` `` `` ` 7HM- J}db
` ` ` ` _7^?aJD ` ` d! `` .% ` ` .MM=
......--_(M{ ` .M[ M#}
d#KVOwrrwzOzz&&z++z++++<(?<<;<<<(<~_~._` ` ` .M] `(] TN,`
` ` J\ ` `.J^ ` .Mt ``_~_~~d@` .M]` ` ` MN}
d#D?<<<<<<<<<<<<<!~~~~~~~~_``` ` `dN.
.b`.M#m,.` `` ` ` ` ` (% ` ` .V! `` ` .M=` (d@` `
` ` ` ` M#} d#n-(-_((<<<~~<!!!!!!~~!~____..._- ``` ` `
.ML X,J##F7WNa.. ` ` (%` ` .J= ` .d#!.
....... .uM= ` ` ` ` MN}
d#P:<<?<?<<<<<<<<_--____~.__~_~_._.` ``` `` ` (N,`.HMM%
(NTTWMNaJ-.. `` ` ` ` ` `` ..d^ ``.JY ` `` .MY ` ``` .MMN, ` `
` ` `.Mr dN_ ` M#} d#R1++(((-<<<<<<?!~~~__......-.._._.-..`` ``
`db ` T%` K(b?.(MMB=7TMMMmag+JJ((J+gHHH@` ` .J" ` ` .H@` ` ` `
````` (TN, ` d@` .M= M#}
d#L......((<??<<<((((--<??<<<<~~_.... `` ` ``` (M^ ` `
R ,N.(F j#6?_,!.=.dgY"` .J=` ..Y^ `` `..H@! ` ` ``` `?Mm.
`.F `(' ` ` M#} d#m(JJzZYYYTTI<<_:<<<<__~!~~ ....._~_~``` `` ` `
` ` ` .MD `?o` Tgb.V!&-(J&VY=dY` ` .D-.JY= `` .gMY``
` `` ` ` `_(ML ` ``( ` ^ ` MN}
d#D??1=z+<<<<?!~_....((++v<<<!_...__~~~._ `` ` `` ` ` ` .dB! ``
j9Xgdm, T""7!` `..J"` ,"=! ` ``` .+M9^ ````
-____--_--_zN_ .M@` J#{ ` ` MN} d#$`
.....J+&AwVY77?~-..-(1+++<<<<~_``` ``` ` .+gHHaJj#B^ ` ` ` W ..Q!`
M9XwVT"` ` ` ...gM9!` ` ` ````` ``-_~~_..-~?(M}` ` `
M#} d#HkWVY""^~-...JzOOOzzOI+<<<___--.`` `` `` `.H@<> ? ?W#o... ` `
H .(Y4#! `d; ` `.M@Tt `` `` ...
_!!_(<dM~ ` ` M#} d#n..J&ZVUXAewUVC<<<__!~-.-~~
...__..`` ` dN,~,`(.(-~/~+?dMM9GJ-..("! .#- .b `.MM`(\ ` ` ``
```` ` ..``.~~-.dF ` ` ` M#}
d#NgdU9UV771+_<!~.._<!` .._!~._~` ..__``.. ` ``
?Mr^.^.(-,!,=(Y1,~,^,7.?174HUgQXTY""^ ` ` ` ` .M3H`J: `
` .. . ...._`_..d#`` ` ` ` M#}
d#81&-<?!~..(??~ ...<<<..!!`.._:~~`.._!`.
..((gMBTA.y.((,:.=.?.,!.>.<.?_J$.>.?.?TYUQ+...` ` ` `` .dB!.# d~
` ` ```` _~-__.. `-__~~(dN+.. ` ` M#}
d#$..-?7!` ..-??_.-?!` ..(<_!`..(?` .(JJ-.-.gMY^(W, ``?MN,~,`(..__,`-
(Y(,_,`(-(._/`-dj7TSa...` ` ` `.&M^ .F X`` ` ` `` ... _<((<-.
_~-?77TMm ` M#} d#r`...+77_.-??!
..(<+<?~..-?!`.._`..?MMHVTMn ` 4x
(MMNJs.J(.i,^.?(,-,!,^.((,!,!.@._<,^,?z"4m+-. ``.+M= ` .] K ` `` `
`-~..`.?7+J<i-. !~(MNe ` ` ` `` ` M#} d#D?_..?7!
..<1+??!...v=! ._!`..<!`._?Mm?h.,h. `W,
...JHMMMMMMMMNgm.ggHp.l.G,?~,'.=d".(!.^.7.?J$!."7U+uM= d `j\ K ` ` . _-.
_. __~..~.?7uJ?1+..MD` ` ` ..M#} d#D!``...?I&?7` ..z7!
..?!`..(7`..~`._~_dNJW,,b ..JdMMH@"!`() ...?7"7!.MNM#"h(_.-_+`(
(__<`+`(J3-`;`(-?MN,`d` d~.b ` _._ ._.~-. . ~. ~_<_._~.(7GJd#! `` ` ` `
` ` `` `.JM@TM#} d#mJ7O+?=` ..JY=` ..?!
..J=`..~`..<_~./<-?WMR.MMM"!J: ,] J: ` d@"WNg.gM""h,
7Wa.o.z./(,~,^.?(?<,!,!.?(,UN.d H .P _..`` ~- . _~__<-.`_.
~-._~(<-._(dMagMMMMHMHg-, ` ` ` .+M= ?M#} d#9=` ..JY"! ..J<! ..J=`
._! ._<~~.?<,!_.~.H#Y!.D J: (\ W ., HN.. (Wr ?L `
/M###Ma,!.=.?-,~,'.=.?b,W#_K .@ .F ._.-.- ~-~_._~~-?1(.__. !_.
?((TM=?~._78aJ7TMMMm, .+g, ` .MD ?73jMN} d#nJV"=` ..?=``..J"!
.,?`..?<<(.7<,?_.~_(!-?`.-(D `d~ J}` .# ,F`,MP7h. ?b `-b
.H#M###Nkl.+.._,m,x.(NdM{.@ .F ,% ._.-___.__<__..~<:.?6-._<. _~.
_?-?i..?<._78QJvTMM#:(HR. (Mh-7T&..W#} d#t .-7^``..J"! ..?!
.(1(!(J7i,<`.~-<<_-? ./! (% `X d~ .F .] JMx 4,.Vb d)
..M#M9=TWM#agJJHM"YYMY!d`.] ($ ()_ ._.-_-(<___.<-(_._<;<_?G,._~. _!-. ?iJ7(.
?i._79W&vTWQMMMNM9i._?7&JMN} d#K7! ..J"! ..?^`..?i?!.J=(-7`.<-(<!./! .?`
.~J} `K W `(% `J% `J7Mm,Wj}d- ,..m+HMB"!.#` K``~~d: K`.F J% `J\`J{_ ._
__.?<(+__~.?-<<- !><-_7n. _<. ?+. _7(?3-._7i.-7WNJJTWHN.. -?T&.M#} d#[..vY!
.J7` .J7-?~.v=(J=`.?<(1?-J> .J! .___`J: @ H g: d{ d~ ?WMNaJmHMB"=`,] .]
` .D K` .D .% d: `J: d!_ .~.._.~.?+?i_-~.?i<(i._<<z(?Tn, _<.. ?1.
?1J7u.._7i..7WNaJ7THm.. W#} dN@^ ..7! ..?1J7-.Z=(J=`./~.1/!.v! .v! .?-/`
,W` .F .@ d` d~ K ` W?!`(% J\ `J: `(\ ` .@ ` J\ J: X` d~`d~
~.~--~.~.~.T,?i.<~-_1J(<. ??+1.?UA, _<..`?7-. ?7(JT&, ?7&,.7TNgJ7THmM#}
d#L.v=` .-7+/^.(Y=.J=`.(!-1+^(J=`.(=` .!-?` ,`.K` ,] .b` K W` .b `.K
`d: d!` d ` J: `.F d:`W H` W` #<_.___._.-
_.<.4,?i.i/-.7J<Ji._<v+i,7Wa, _7-.`_7+,`.7O,?4J. ?T&..?TMmJMN}
d#t`..vCJ7!.JY^.J=`.-^(Jz?_(f! .J= .!.?` (!.!.@ ,% .F .@ K .] .P`
K` ` W ` K ` X` (\ K # .@ K b.?/-__._.-_._-__.4,?o,1_i.?&<(1.
?11v+_7Ha,`.=(. 71. (TuJTG.. ?T&,.?MN} d#K7iJ=~.gY!.J"`..7-(1/^.v=` .Z^
.,!.?` ,!./`.JF `(\ .F `.P `.@ `-} ` .$ .P K` .] P ` `J: D F ,D
.@ .@_..+<.(-(.~.<.~.?,(4,?a.1-<.?GJi?i..7z1C-?THa. .7+. ?4.. 70.?4a, ?4M#}
d#8=..dY!.J"`..?~.CJ=-(Y! .JY! .(!.> ,!.(! ,zd\` J} .] ,t .b (` ` .\ .%
`.P .\` ! `J` ` ' \ (% .b .](__ 1<.<i.~.__- <.<.?N,?n.<,<.(4,1J1,
?1CJI.?UN+. .7i.` _7+,` ?Ta,7U+.M#} d#mdY~.J"` .v!.vu7~.d=` .d=``./!.7 ,^ ,!
.1zuW{``J_ ,] `(\ `,P`` ` ``.```(:``` %``` ` ``` `` ` `` ``` ``(:` ,D
.8.(/- 1(-((.~.?.<..-.1.?N,?n.7,<..T&?(7+..7JOv&,?WNJ.`.7&,``.7n, `.7UJ(MN}
d##H#####H##H###HHH#H#H###H#H##MHHH##H#HHH#H####HHHH###H###H###H##H###H#H#H#HH#H##HHH##H#H#H#H#####HHHH#H#HHH#HH#H#MH#HH#HH#HH#HH#HH##H##H#HH#HH##HH#H###H##HHH##H##HH#H#HHH#HHHMH###H##M####{
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
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<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
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 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())
#define MATHPI acos(-1)
#define itn int;
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;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int main(void) {
ll n, k;
cin >> n >> k;
vll v(n);
rep(i, n) cin >> v[i];
Rort(v);
rep(i, k) v[i] = 0;
ll ans = 0;
rep(i, n) ans += v[i];
fin(ans);
}
| /*
-J+J+JJ+JJ+++++++J++JJ+J++J+J+J+JJJJ+JJ+++++JJ+J+JJJ+J+JJ+JJ++JJ++J+JJ+JJ+JJJJ++J++J+JJ++++JJJ++JJJ+J++J++JJ++++JJJJJ++J++J++++JJJ++++J+JJJ+J+++++++++J+JJ+JJJJJJJJJJJ++JJJJJJJJJJJJJJJJJJJ+J.
d##""H#"TMY"""HBWB"T#"HYHYWMYWMY"WYMMY"TMM""W#"TMYBYMYBMH@T@""B"WTWTY"YY"MBBT#YM"YBTW"YY"UBWW"TH9"B"T@Y"WM"T@W""BB"WBY@W"TBBM"WWB"#"T@"T#"TM"T#"W9""W@4#TM@""""""""""""""""""""""""""""""""M#}
d#HU+.(4, ?&. (S(0,.4,?o?&?Wo?H, ?o3X, .Wn. ?p ?h,>?h,cSO.(. (_.;I<1 >
1%( W Z_.O,( ._`(>(+ .z_.o..a[ dh-(Je.,+`.v_c.>.Cv(!,jf.J .= .= .#!.=.J!
.J!.=.dF M#} d#r_4dn, 7&.?G,
(U(6,.4,?&7,?W,7h, T,Un.`7k, (h.?N,l?h,vSO.<.`1
((O,<`(..w(mHHNa.z.+.+NMMMms`.1d@"7CMb.H@=77MN3dMMMMMN.2/(!((t.C ,^ ,' JY
J!.=` .=.m(k#^ MN} d#r ?XS..?G,-4,
-4J6,.4,7J4,4h,4n.(ojX, (H& .h.,N-i(h.v6G 1..o.agag. >.MY` TNy(MB^.&,.(M[(dM\
j#@(M\ .MEGM$ dNvJ.!J(%.= (` J`.d^.=./` .=-J!?N{` M#} d#MN&. _4Z&..4,.7,
.4J6,.4,4-O-4o(W, </wi 4n. 4,.HJo,h,zQMMBY""7??Mb (M!.HMggMM8MF`(######%(d#
.M#NM#` (#j##` `.#@J.!(J^.'.2 .? .F J!.^`.J!,^ .JM] ` ` M#} d#[ 7Mm, ?wS,
7&.?i.`.4J4,(6,6(G?W,7h..1daJ.?k,.dMB""WMm,JM_ ` MM2M] (M####N(Mb
.WMM###%(MF .###M% `.MSMM\ `.M#@(!JJ'.^.>`.'.J^.>./` .^.= .J~.#\ ` M#} d#@0,
.TMa, .4Z&.jm+ga. 7,3,(1,1gHMN/4gM"??7WMNM% ....dMn,M{
(gQM###NdN,..7"YMM(dMm, ` ?H[dM! d####` `(NW#F JHMI!JJ!(!.^
(`.f`(!,'`.7.?` ,^.W#@ ` M#} d#r 7G,
?TNJ.`.H#"!`_?Hm.(dMMN,(u#) MNMY.&Mm.(M#F`J######K4M} ` J####a(#Mm,
WNmgM#Ne MPW# .M###P `.M##M! .M##!(J~J`,!.> .=.>.? ./~/! .^.V^ Mb ` `
M#} d#Bu,` 7&, ?WmM=`.., ` MMM` M#Mh,Mb`d#E d######Hb d###H###mH[
.+gMM#MY!W##N. dMI####M~ .M1#HH#MM###m-.J###Ngg-H###(v_/ / .!.v!,~(! .!,!
.>.Z^ .JX# `` ` ` MN} d#r 7G, `.7&.M>
.M##aJd### M##MeWN J#t`M##H####N ,M###MY"M#L` 7!` MM-
7"^`.j##-(TMY^.(MHN##"W##HMMTWM####"WM###HDv_>./ (`.=.>.!`.?.!`.?(v^ ./!.(N_
` ` ` ` M#} d#fT-. 71, d@` ,####H###N d###### ,NL
(####MMM#L`(M#MF .M#N ....+##NJ....g####NaJJgHH#####mJJ####L..M##Mt
(##M#F.!.!.~ J',~(`./-? .?(v^ ./`.JgMN_ ` ` ` (WN-..Ja.` ` `
M#} d#m, _7&,` ?1JN,` ?MMH###HM. ,MH##Mt .#N. ?MH#$ .H#e ` `
.d##MHMM#####H#H#H###H###H#H##H#HH######M##H###H###MHgJ#H##M<!,!.!.2.?.!
.~_`./(z^`.?`.jgD`.M: ` j(+HM#"~dMB` MN} d#kXWm.. ?1.
?MN&.. ` ?M##| .THB= `.##k. _`
j###NgJ&M####HH#H#H#HH#H#H#HH##HHH#H#HH##HHHHHHHHHHHHHH#HHHH####H##M#!_
.`,!.~_ .!.! ,<J^`.?`.ud= .Z4N! ?^ (N/^ ` ` MN} d#r
?4xTHa, ?=-.TM#Mp -##b ` g###NJ.
..H#####H####H##H###H#HMMMMM###H#H###H###H#H##H#H##H##H##HH##H#HH##H##Hb_ _
/_~.! __! ,~J! .<..uV^.-Y_(dN` ` dN. ` MN} d#@I..
-7Ov9A..(OdM#M; `.###m.`` ` (##H#H#####HHH#HH#HHHH#HH#H#####p `
?"WM####H#H##H#HH#H#HH#H#H#H#H#H#H#HH#H###% `.!.__ .~_ .~(! .ugMMM:.uN.<-!d@
.M% M#} d#r `_71.. ?WMBW#NJ#@`
`(H##MMmJ..+M#H#H#H#H##H##H##H#####H##H#H###9"`
(TMH###HH##H###H##H#H#H#####H###H##H#H<`(__.`.~.`.~.! .gM@!`d#MYXM?~.(#% ` `
` ` MN} d#MHQ.. _7uM] `?""`
`.M#####H##H#H#H##H#H#HHH#HHH##H#H#H##H#H###Ma.` `
?M##################H##H###H##H####._ _` ..`.~.! .gMY` ` dN_!.(# ` ` ``
` ` M#} d#NQyUWHmJ. dN. ` ` `
.M##HH##H#H#H#H#H##H####HH#H#HH#H#H#HH##H#####Ma.` ` `
MMY^?WMHH#MMHY""""""YHMMH##H##H##` ` _` .! .(MD` ` ` .M].<(M% ` ` (J.
+. M#}
d#r?TUHXgVUWWMNJ....JH##HH#HH#H#HH#H#HHHH#HHH#H#H#H##H##H##H#H#HHH####MNg,.``
`` .-M= ..J"=` _7TM###] ._ ._(#^ ` j#+dWMF
?N,?^.MD ` ` MN} d#b-.
_7TWHAZVWMM######H###H##H#HH#H##H#H#H#H#H#HHH##H##H#########MM######MNa&J(H_..v"!
... ` ?WNJ.`` .d@` ` ` (MSVGMD ` `
-@! ` M#} d#D(._71-.
?7TUkeVHM###H#H##HH#H#HH#HH#H#H#HH#HH##HHHHH#HH#HMMM}(M%.MHMM##H#####M#^
`?=jV"N ` ` ` ` ` ` ` TNe. `` .(M@` ` ` (M^.d#^ ` ` .Y!` ` ` M#}
d#L. ?7+._?1(.. ?7TSdHM####H##H#H#H#H#H#HH#H#H#H#H##H#H####M#`
(!.M#######=(J` ..VM=.., ` ` ..... ` .WN,... J#` `` ` .dMmM9^
! M#} d#HWWX&-.. _?<._?<-..
?7THM#H#H#HH#HH#H#H#HH#H#H#HHH##H#H##H) ` ` ?M###H#^.dnJV"H-,@"!.b `
... ` dN-`?4,` ` XMY"WMM'` ` `(MM##Na.. `` ` ` ` M#}
d#KvCOwZVUXG+-. ?~-.<<-. _?TMH#######HH#H#H#HH#H##HHH#H#HH#N. `
...JH=(M##^ J=` .gMWWMN, w,.-Y=_Ta. d!4, `? ,` ,h.gMN, ` `
`.HD-(7THNa, `` ` ` ` `.. `` ` M#}
d#K+Jv71Jv71OOOZXy+.. _!_.<!-._TMH#H#H#H#HH#H#HH#HH#H#HH#H#H#MVV"=?^.=.?(MD
.d! .X= ` ?N_ `?^` `.J7ND. (h, ` W ` ` `(b_ W_ ` ..+#MMHN+(+z7MN+ `
(MNgNm. ` M#} d#r~?7COOz++?<<+++1zOvOz(..
`_._~(TM########H##H#H#H#H#HH#HHMMI`(_.: {`(d' .f! .=.x . W! `..MHBWMNx
(4&. W `d[ uY` d#WMY` d#"WN<<_(WN, ` ` ` JB! .M= `
M#} d#Ha-... ~?71zz((<<_<<<+<z1+-..
`._TM#H#####H#H##H#H##H####N&~.-(-mVU@``.d! .M#n...dN.7` ` ` .Y! ` (WN,
?UJK .@ .@ ` .Mb ` ` MHWN; .JN;`` ` `,"` vM#` MN}
d#mJv777VUUuJ... ??<1+((<~~:<<;<:-.. _TM##M##H#H##HHH#HH#H##NVY"! .K`
J\ .dMH#######{ <J/ ` dN. .D ` `.h.d^..M#THJ.` ` JMN,.(dN.
.(#"M\ ` ` MN} d#b(.._??<<((+??7TOO&(...
`~?<_____~___..._TMH##H#H##H#H#H#H##! ` d! .F d#MH#H##### `
.M#m....JMp.M{ `(\ ` `.P`.JM#M~.> T4a, .dE..(N~ ` .J"` `
` ` MN} d#mJ...._!??<_.-_<<!~_(<?<<11-...
`__.-.````-TM###H#H#HH#H##N, .t d` H^ W##MM#M^ `` jH##H######N ^ `
X` ` .NM#N#MHJ-,!,_./4a. .JM9<_(dN,` ` `` ` ` ` MN}
d#h((-+7""YYUAgJ-..._~!_---_~~___~<!~-.. ` ` ."MM##H##H#H##M)` ` X(...F
?> .J@! ` .###H###H#### ` .F ` `(###M= .W,^.?./<,TQMb<~~((+M]
.-. M#} d#o. `` ~???<~~-(<?77T71+--...`` ` . ```` `
.TM##H##H###F .PdF_7` ?` ` ``dB=d##H#M##M' d` ` .#W#@!
7L.? (~.>,MF_`` ..M\ ` ` .MF` ` ` MN}
d#f?777"TTCIz++-...... ``````._~<!~~... .TM#####Hb` ,SH: ` `
" ` `?! ?"=!.MM^ ` ``.t ` ` (aY^ ` (b--(.(&MY` ...(MF ` .M} `
MN} d#D<<<<(-..........` `~~??!<!~~_.... `` ` ` ` ` .7MM##N JCM-
` R ..` ` (Y` ` .K` ` .@` ` ,N/(dMY_ ..__~_dN. .M}
` M#} d#NA&&JJ-(-............___~~`_`` `` `` ` 7HM- J}db
` ` ` ` _7^?aJD ` ` d! `` .% ` ` .MM=
......--_(M{ ` .M[ M#}
d#KVOwrrwzOzz&&z++z++++<(?<<;<<<(<~_~._` ` ` .M] `(] TN,`
` ` J\ ` `.J^ ` .Mt ``_~_~~d@` .M]` ` ` MN}
d#D?<<<<<<<<<<<<<!~~~~~~~~_``` ` `dN.
.b`.M#m,.` `` ` ` ` ` (% ` ` .V! `` ` .M=` (d@` `
` ` ` ` M#} d#n-(-_((<<<~~<!!!!!!~~!~____..._- ``` ` `
.ML X,J##F7WNa.. ` ` (%` ` .J= ` .d#!.
....... .uM= ` ` ` ` MN}
d#P:<<?<?<<<<<<<<_--____~.__~_~_._.` ``` `` ` (N,`.HMM%
(NTTWMNaJ-.. `` ` ` ` ` `` ..d^ ``.JY ` `` .MY ` ``` .MMN, ` `
` ` `.Mr dN_ ` M#} d#R1++(((-<<<<<<?!~~~__......-.._._.-..`` ``
`db ` T%` K(b?.(MMB=7TMMMmag+JJ((J+gHHH@` ` .J" ` ` .H@` ` ` `
````` (TN, ` d@` .M= M#}
d#L......((<??<<<((((--<??<<<<~~_.... `` ` ``` (M^ ` `
R ,N.(F j#6?_,!.=.dgY"` .J=` ..Y^ `` `..H@! ` ` ``` `?Mm.
`.F `(' ` ` M#} d#m(JJzZYYYTTI<<_:<<<<__~!~~ ....._~_~``` `` ` `
` ` ` .MD `?o` Tgb.V!&-(J&VY=dY` ` .D-.JY= `` .gMY``
` `` ` ` `_(ML ` ``( ` ^ ` MN}
d#D??1=z+<<<<?!~_....((++v<<<!_...__~~~._ `` ` `` ` ` ` .dB! ``
j9Xgdm, T""7!` `..J"` ,"=! ` ``` .+M9^ ````
-____--_--_zN_ .M@` J#{ ` ` MN} d#$`
.....J+&AwVY77?~-..-(1+++<<<<~_``` ``` ` .+gHHaJj#B^ ` ` ` W ..Q!`
M9XwVT"` ` ` ...gM9!` ` ` ````` ``-_~~_..-~?(M}` ` `
M#} d#HkWVY""^~-...JzOOOzzOI+<<<___--.`` `` `` `.H@<> ? ?W#o... ` `
H .(Y4#! `d; ` `.M@Tt `` `` ...
_!!_(<dM~ ` ` M#} d#n..J&ZVUXAewUVC<<<__!~-.-~~
...__..`` ` dN,~,`(.(-~/~+?dMM9GJ-..("! .#- .b `.MM`(\ ` ` ``
```` ` ..``.~~-.dF ` ` ` M#}
d#NgdU9UV771+_<!~.._<!` .._!~._~` ..__``.. ` ``
?Mr^.^.(-,!,=(Y1,~,^,7.?174HUgQXTY""^ ` ` ` ` .M3H`J: `
` .. . ...._`_..d#`` ` ` ` M#}
d#81&-<?!~..(??~ ...<<<..!!`.._:~~`.._!`.
..((gMBTA.y.((,:.=.?.,!.>.<.?_J$.>.?.?TYUQ+...` ` ` `` .dB!.# d~
` ` ```` _~-__.. `-__~~(dN+.. ` ` M#}
d#$..-?7!` ..-??_.-?!` ..(<_!`..(?` .(JJ-.-.gMY^(W, ``?MN,~,`(..__,`-
(Y(,_,`(-(._/`-dj7TSa...` ` ` `.&M^ .F X`` ` ` `` ... _<((<-.
_~-?77TMm ` M#} d#r`...+77_.-??!
..(<+<?~..-?!`.._`..?MMHVTMn ` 4x
(MMNJs.J(.i,^.?(,-,!,^.((,!,!.@._<,^,?z"4m+-. ``.+M= ` .] K ` `` `
`-~..`.?7+J<i-. !~(MNe ` ` ` `` ` M#} d#D?_..?7!
..<1+??!...v=! ._!`..<!`._?Mm?h.,h. `W,
...JHMMMMMMMMNgm.ggHp.l.G,?~,'.=d".(!.^.7.?J$!."7U+uM= d `j\ K ` ` . _-.
_. __~..~.?7uJ?1+..MD` ` ` ..M#} d#D!``...?I&?7` ..z7!
..?!`..(7`..~`._~_dNJW,,b ..JdMMH@"!`() ...?7"7!.MNM#"h(_.-_+`(
(__<`+`(J3-`;`(-?MN,`d` d~.b ` _._ ._.~-. . ~. ~_<_._~.(7GJd#! `` ` ` `
` ` `` `.JM@TM#} d#mJ7O+?=` ..JY=` ..?!
..J=`..~`..<_~./<-?WMR.MMM"!J: ,] J: ` d@"WNg.gM""h,
7Wa.o.z./(,~,^.?(?<,!,!.?(,UN.d H .P _..`` ~- . _~__<-.`_.
~-._~(<-._(dMagMMMMHMHg-, ` ` ` .+M= ?M#} d#9=` ..JY"! ..J<! ..J=`
._! ._<~~.?<,!_.~.H#Y!.D J: (\ W ., HN.. (Wr ?L `
/M###Ma,!.=.?-,~,'.=.?b,W#_K .@ .F ._.-.- ~-~_._~~-?1(.__. !_.
?((TM=?~._78aJ7TMMMm, .+g, ` .MD ?73jMN} d#nJV"=` ..?=``..J"!
.,?`..?<<(.7<,?_.~_(!-?`.-(D `d~ J}` .# ,F`,MP7h. ?b `-b
.H#M###Nkl.+.._,m,x.(NdM{.@ .F ,% ._.-___.__<__..~<:.?6-._<. _~.
_?-?i..?<._78QJvTMM#:(HR. (Mh-7T&..W#} d#t .-7^``..J"! ..?!
.(1(!(J7i,<`.~-<<_-? ./! (% `X d~ .F .] JMx 4,.Vb d)
..M#M9=TWM#agJJHM"YYMY!d`.] ($ ()_ ._.-_-(<___.<-(_._<;<_?G,._~. _!-. ?iJ7(.
?i._79W&vTWQMMMNM9i._?7&JMN} d#K7! ..J"! ..?^`..?i?!.J=(-7`.<-(<!./! .?`
.~J} `K W `(% `J% `J7Mm,Wj}d- ,..m+HMB"!.#` K``~~d: K`.F J% `J\`J{_ ._
__.?<(+__~.?-<<- !><-_7n. _<. ?+. _7(?3-._7i.-7WNJJTWHN.. -?T&.M#} d#[..vY!
.J7` .J7-?~.v=(J=`.?<(1?-J> .J! .___`J: @ H g: d{ d~ ?WMNaJmHMB"=`,] .]
` .D K` .D .% d: `J: d!_ .~.._.~.?+?i_-~.?i<(i._<<z(?Tn, _<.. ?1.
?1J7u.._7i..7WNaJ7THm.. W#} dN@^ ..7! ..?1J7-.Z=(J=`./~.1/!.v! .v! .?-/`
,W` .F .@ d` d~ K ` W?!`(% J\ `J: `(\ ` .@ ` J\ J: X` d~`d~
~.~--~.~.~.T,?i.<~-_1J(<. ??+1.?UA, _<..`?7-. ?7(JT&, ?7&,.7TNgJ7THmM#}
d#L.v=` .-7+/^.(Y=.J=`.(!-1+^(J=`.(=` .!-?` ,`.K` ,] .b` K W` .b `.K
`d: d!` d ` J: `.F d:`W H` W` #<_.___._.-
_.<.4,?i.i/-.7J<Ji._<v+i,7Wa, _7-.`_7+,`.7O,?4J. ?T&..?TMmJMN}
d#t`..vCJ7!.JY^.J=`.-^(Jz?_(f! .J= .!.?` (!.!.@ ,% .F .@ K .] .P`
K` ` W ` K ` X` (\ K # .@ K b.?/-__._.-_._-__.4,?o,1_i.?&<(1.
?11v+_7Ha,`.=(. 71. (TuJTG.. ?T&,.?MN} d#K7iJ=~.gY!.J"`..7-(1/^.v=` .Z^
.,!.?` ,!./`.JF `(\ .F `.P `.@ `-} ` .$ .P K` .] P ` `J: D F ,D
.@ .@_..+<.(-(.~.<.~.?,(4,?a.1-<.?GJi?i..7z1C-?THa. .7+. ?4.. 70.?4a, ?4M#}
d#8=..dY!.J"`..?~.CJ=-(Y! .JY! .(!.> ,!.(! ,zd\` J} .] ,t .b (` ` .\ .%
`.P .\` ! `J` ` ' \ (% .b .](__ 1<.<i.~.__- <.<.?N,?n.<,<.(4,1J1,
?1CJI.?UN+. .7i.` _7+,` ?Ta,7U+.M#} d#mdY~.J"` .v!.vu7~.d=` .d=``./!.7 ,^ ,!
.1zuW{``J_ ,] `(\ `,P`` ` ``.```(:``` %``` ` ``` `` ` `` ``` ``(:` ,D
.8.(/- 1(-((.~.?.<..-.1.?N,?n.7,<..T&?(7+..7JOv&,?WNJ.`.7&,``.7n, `.7UJ(MN}
d##H#####H##H###HHH#H#H###H#H##MHHH##H#HHH#H####HHHH###H###H###H##H###H#H#H#HH#H##HHH##H#H#H#H#####HHHH#H#HHH#HH#H#MH#HH#HH#HH#HH#HH##H##H#HH#HH##HH#H###H##HHH##H##HH#H#HHH#HHHMH###H##M####{
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
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<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
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 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())
#define MATHPI acos(-1)
#define itn int;
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;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int main(void) {
ll n, k;
cin >> n >> k;
vll v(n);
rep(i, n) cin >> v[i];
Rort(v);
rep(i, min(k, n)) v[i] = 0;
ll ans = 0;
rep(i, n) ans += v[i];
fin(ans);
} | replace | 252 | 253 | 252 | 253 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF 100000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
typedef long long ll;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
using namespace std;
int n, m, ans;
int a[111111];
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n, greater<>());
rep(i, n) {
if (m != 0) {
m--;
} else {
ans += a[i];
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF 100000000000000007
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
typedef long long ll;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
using namespace std;
int n, m, ans;
int a[211111];
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n, greater<>());
rep(i, n) {
if (m != 0) {
m--;
} else {
ans += a[i];
}
}
cout << ans << endl;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
using namespace std;
inline int read() {
int x = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
return x;
}
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
inline void write(int x) {
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
int n, a[100050], k;
LL sum;
int main() {
int i;
read(n), read(k);
if (n <= k) {
cout << 0 << endl;
return 0;
}
for (i = 1; i <= n; ++i)
read(a[i]);
sort(a + 1, a + n + 1);
n -= k;
sum = 0;
for (i = 1; i <= n; ++i)
sum += a[i];
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define LL long long
using namespace std;
inline int read() {
int x = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
return x;
}
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
inline void write(int x) {
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
int n, a[200050], k;
LL sum;
int main() {
int i;
read(n), read(k);
if (n <= k) {
cout << 0 << endl;
return 0;
}
for (i = 1; i <= n; ++i)
read(a[i]);
sort(a + 1, a + n + 1);
n -= k;
sum = 0;
for (i = 1; i <= n; ++i)
sum += a[i];
cout << sum << endl;
return 0;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p02785 | C++ | Runtime Error | //{{{
#include <bits/stdc++.h>
using namespace std;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
//{{{ rep rrep loop
#define repX(a, b, c, d, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep4, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep4, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rep4(i, begin, end, step) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; i += step)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define rrep4(i, begin, end, step) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; i -= step)
//}}}
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
//{{{ Type
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T> vector<T> Vector(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Tail> auto Vector(size_t a, Tail... tail) {
return vector<decltype(Vector(tail...))>(a, Vector(tail...));
}
//}}}
//{{{ STL overload
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
//}}}
//{{{ Functions
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
ll popcount(ll a) {
a -= ((a >> 1) & 0x5555555555555555LL);
a = (a & 0x3333333333333333LL) + ((a >> 2) & 0x3333333333333333LL);
a = (a + (a >> 4)) & 0x0f0f0f0f0f0f0f0fLL;
a += (a >> 8);
a += (a >> 16);
a += (a >> 32);
return a & 0x7f;
}
//}}}
//{{{ in
class in {
int n, m;
public:
in() : n(0), m(0) {}
in(int n) : n(n), m(0){};
in(int n, int m) : n(n), m(m){};
template <class T> operator T() {
assert(n == 0);
assert(m == 0);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n > 0);
assert(m == 0);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n > 0);
assert(m > 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
//}}}
//{{{ << overload
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
//}}}
//{{{ print / out
template <class T> int print(const T &a) {
cout << a;
return 0;
}
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
//}}}
//{{{ debug_print / debug_out
#ifdef LOCAL
#if 1 // Colorize
#include "console_color.hpp"
#else
#define setColor(...)
#endif
template <class T> int debug_print(const T &a) {
cerr << a;
return 0;
}
inline int debug_out() {
cerr << '\n';
return 0;
}
template <class T> inline int debug_out(const T &t) {
debug_print(t);
cerr << '\n';
return 0;
}
template <class Head, class... Tail>
inline int debug_out(const Head &head, const Tail &...tail) {
debug_print(head);
cerr << " ";
debug_out(tail...);
return 0;
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ":"; \
setColor(); \
cerr << " "; \
debug_out(__VA_ARGS__); \
} while (0)
#else
#define debug_print(...)
#define debug_out(...)
#define debug(...)
#endif
//}}}
//{{{ Modular
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
Modular pow(u64 t) const {
if (!t)
return 1;
Modular<Mod> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
//}}}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll N = in();
ll K = in();
vi A = in(N);
rsort(A);
rep(i, K) { A[i] = 0; }
ll ans = Sum(A);
out(ans);
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
//{{{ rep rrep loop
#define repX(a, b, c, d, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep4, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep4, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rep4(i, begin, end, step) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; i += step)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define rrep4(i, begin, end, step) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; i -= step)
//}}}
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
//{{{ Type
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T> vector<T> Vector(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Tail> auto Vector(size_t a, Tail... tail) {
return vector<decltype(Vector(tail...))>(a, Vector(tail...));
}
//}}}
//{{{ STL overload
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
//}}}
//{{{ Functions
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
ll popcount(ll a) {
a -= ((a >> 1) & 0x5555555555555555LL);
a = (a & 0x3333333333333333LL) + ((a >> 2) & 0x3333333333333333LL);
a = (a + (a >> 4)) & 0x0f0f0f0f0f0f0f0fLL;
a += (a >> 8);
a += (a >> 16);
a += (a >> 32);
return a & 0x7f;
}
//}}}
//{{{ in
class in {
int n, m;
public:
in() : n(0), m(0) {}
in(int n) : n(n), m(0){};
in(int n, int m) : n(n), m(m){};
template <class T> operator T() {
assert(n == 0);
assert(m == 0);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n > 0);
assert(m == 0);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n > 0);
assert(m > 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
//}}}
//{{{ << overload
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
//}}}
//{{{ print / out
template <class T> int print(const T &a) {
cout << a;
return 0;
}
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
//}}}
//{{{ debug_print / debug_out
#ifdef LOCAL
#if 1 // Colorize
#include "console_color.hpp"
#else
#define setColor(...)
#endif
template <class T> int debug_print(const T &a) {
cerr << a;
return 0;
}
inline int debug_out() {
cerr << '\n';
return 0;
}
template <class T> inline int debug_out(const T &t) {
debug_print(t);
cerr << '\n';
return 0;
}
template <class Head, class... Tail>
inline int debug_out(const Head &head, const Tail &...tail) {
debug_print(head);
cerr << " ";
debug_out(tail...);
return 0;
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ":"; \
setColor(); \
cerr << " "; \
debug_out(__VA_ARGS__); \
} while (0)
#else
#define debug_print(...)
#define debug_out(...)
#define debug(...)
#endif
//}}}
//{{{ Modular
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
Modular pow(u64 t) const {
if (!t)
return 1;
Modular<Mod> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
//}}}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll N = in();
ll K = in();
vi A = in(N);
rsort(A);
rep(i, min(K, N)) { A[i] = 0; }
ll ans = Sum(A);
out(ans);
}
| replace | 321 | 322 | 321 | 322 | 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; // long longをllとして簡略
int main() {
ll n, k;
ll ans = 0;
cin >> n >> k; // monster_no,deathblow_no
vector<ll> h(n); // monster hp
rep(i, n) { cin >> h[i]; }
sort(h.rbegin(), h.rend());
rep(i, k) { h[i] = 0; }
rep(i, n) { 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; // long longをllとして簡略
int main() {
ll n, k;
ll ans = 0;
cin >> n >> k; // monster_no,deathblow_no
vector<ll> h(n); // monster hp
rep(i, n) { cin >> h[i]; }
sort(h.rbegin(), h.rend());
rep(i, k) {
h[i] = 0;
if (n == i) {
cout << ans << endl;
return 0;
}
}
rep(i, n) { ans += h[i]; }
cout << ans << endl;
return 0;
} | replace | 12 | 13 | 12 | 19 | 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 - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a > b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = x - 1; i >= ; i--)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLr(obj) (obj).rbegin(), (obj).rend()
#define endl "\n"
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1e9 + 7;
int main() {
ll h, n, ans = 0;
cin >> n >> h;
ll a[101010];
rep(i, n) { cin >> a[i]; }
sort(a, a + n);
repr(i, n - h) { ans += a[i]; }
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a > b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = x - 1; i >= ; i--)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLr(obj) (obj).rbegin(), (obj).rend()
#define endl "\n"
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1e9 + 7;
int main() {
ll h, n, ans = 0;
cin >> n >> h;
ll a[201010];
rep(i, n) { cin >> a[i]; }
sort(a, a + n);
repr(i, n - h) { ans += a[i]; }
cout << ans << endl;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02785 | Python | Time Limit Exceeded | N, K = map(int, input().split())
H = [int(N) for N in input().split()]
for i in range(0, K):
if H[H.index(max(H))] == 0:
break
H[H.index(max(H))] = 0
print(sum(filter(lambda x: x != 0, H)))
| N, K = map(int, input().split())
H = [int(N) for N in input().split()]
H.sort(reverse=True)
if N <= K:
print(0)
else:
for i in range(0, K):
H[i] = 0
print(sum(H))
| replace | 2 | 7 | 2 | 9 | TLE | |
p02785 | Python | Runtime Error | N, K = map(int, input().split())
H = map(int, input().split())
H.sort(reverse=True)
if K >= N:
print(0)
else:
print(sum(H[K:]))
| N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort(reverse=True)
if K >= N:
print(0)
else:
print(sum(H[K:]))
| replace | 1 | 2 | 1 | 2 | AttributeError: 'map' object has no attribute 'sort' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02785/Python/s623070047.py", line 4, in <module>
H.sort(reverse=True)
AttributeError: 'map' object has no attribute 'sort'
|
p02785 | Python | Time Limit Exceeded | n, k = map(int, input().split())
h = sorted(map(int, input().split()), reverse=True)
if k == 0:
print(sum(h))
elif k < n:
for i in range(k):
h.pop(0)
print(sum(h))
else:
print(0)
| n, k = map(int, input().split())
h = sorted(map(int, input().split()), reverse=True)
if k == 0:
print(sum(h))
elif k < n:
print(sum(h[k:]))
else:
print(0)
| replace | 5 | 8 | 5 | 6 | TLE | |
p02785 | Python | Runtime Error | H, K = map(int, input().split())
hp = list(int, map(input().split()))
hp.sort(reverse=True)
print(sum(hp[K:]))
| H, K = map(int, input().split())
hp = list(map(int, input().split()))
hp.sort(reverse=True)
print(sum(hp[K:]))
| replace | 1 | 2 | 1 | 2 | TypeError: map() must have at least two arguments. | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02785/Python/s611990638.py", line 2, in <module>
hp = list(int, map(input().split()))
TypeError: map() must have at least two arguments.
|
p02785 | Python | Time Limit Exceeded | N, K = map(int, input().split())
H = list(map(int, input().split()))
H_sorted = sorted(H, reverse=True)
for _ in range(K):
if not len(H_sorted):
break
H_sorted.pop(0)
print(sum(H_sorted))
| N, K = map(int, input().split())
H = list(map(int, input().split()))
H_sorted = sorted(H, reverse=True)
print(sum(H_sorted[K:]))
| replace | 5 | 11 | 5 | 6 | TLE | |
p02785 | Python | Time Limit Exceeded | import sys
n, k = map(int, input().split())
hp_list = list(map(int, input().split()))
hp_list.sort(reverse=True)
if k >= len(hp_list):
print(0)
sys.exit()
for del_num in range(k):
del hp_list[0]
print(sum(hp_list))
| import sys
n, k = map(int, input().split())
hp_list = list(map(int, input().split()))
hp_list.sort(reverse=True)
if k >= len(hp_list):
print(0)
sys.exit()
hp_list = hp_list[k:]
print(sum(hp_list))
| replace | 10 | 12 | 10 | 11 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, m, sumv = 0;
long long mon[100005];
long long cmp(long long a, long long b) { return a < b; }
int main() {
cin >> n >> m;
for (long long i = 1; i <= n; i++)
cin >> mon[i];
if (n <= m) {
cout << 0 << endl;
return 0;
}
sort(mon + 1, mon + n + 1, cmp);
for (long long i = 1; i <= n - m; i++)
sumv += mon[i];
cout << sumv << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, m, sumv = 0;
long long mon[200005];
long long cmp(long long a, long long b) { return a < b; }
int main() {
cin >> n >> m;
for (long long i = 1; i <= n; i++)
cin >> mon[i];
if (n <= m) {
cout << 0 << endl;
return 0;
}
sort(mon + 1, mon + n + 1, cmp);
for (long long i = 1; i <= n - m; i++)
sumv += mon[i];
cout << sumv << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | Python | Runtime Error | n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
for i in range(k):
h.pop()
print(sum(h))
| n, k = map(int, input().split())
h = list(map(int, input().split()))
if n <= k:
print(0)
exit()
h.sort()
for i in range(k):
h.pop()
print(sum(h))
| insert | 2 | 2 | 2 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define int long long
#define mod (int)(1000000007)
using namespace std;
int test[123456];
signed main() {
int n, m, a, b = 0, ans = 0;
cin >> n >> m;
for (int h = 0; h < n; h++) {
cin >> test[h];
}
sort(test, test + n);
for (int h = 0; h < n - m; h++) {
ans += test[h];
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define int long long
#define mod (int)(1000000007)
using namespace std;
int test[213456];
signed main() {
int n, m, a, b = 0, ans = 0;
cin >> n >> m;
for (int h = 0; h < n; h++) {
cin >> test[h];
}
sort(test, test + n);
for (int h = 0; h < n - m; h++) {
ans += test[h];
}
cout << ans << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define sz 2010
using namespace std;
ll num[sz];
int main() {
ll n, k, i, j, a, b, x, c, d;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> num[i];
}
sort(num + 1, num + n + 1);
c = 0;
for (i = n; i >= 1; i--) {
if (k > 0)
k--;
else {
c += num[i];
}
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define sz 200010
using namespace std;
ll num[sz];
int main() {
ll n, k, i, j, a, b, x, c, d;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> num[i];
}
sort(num + 1, num + n + 1);
c = 0;
for (i = n; i >= 1; i--) {
if (k > 0)
k--;
else {
c += num[i];
}
}
cout << c << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 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 ll long long
int main() {
int N, K;
cin >> N >> K;
vector<ll> monhp(N);
rep(i, N) { cin >> monhp.at(i); }
stable_sort(monhp.begin(), monhp.end(), greater<ll>());
if (K != 0) {
vector<ll> hissatu(K);
copy(monhp.begin(), monhp.begin() + K, hissatu.begin());
cout << accumulate(monhp.begin(), monhp.end(), 0LL) -
accumulate(hissatu.begin(), hissatu.end(), 0LL)
<< endl;
} else {
cout << accumulate(monhp.begin(), monhp.end(), 0LL) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int N, K;
cin >> N >> K;
vector<ll> monhp(N);
rep(i, N) { cin >> monhp.at(i); }
stable_sort(monhp.begin(), monhp.end(), greater<ll>());
if (K != 0) {
int num = min(K, N);
vector<ll> hissatu(num);
copy(monhp.begin(), monhp.begin() + num, hissatu.begin());
cout << accumulate(monhp.begin(), monhp.end(), 0LL) -
accumulate(hissatu.begin(), hissatu.end(), 0LL)
<< endl;
} else {
cout << accumulate(monhp.begin(), monhp.end(), 0LL) << endl;
}
}
| replace | 12 | 14 | 12 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// pair sort
bool compare_by_b(pair<LL, LL> a, pair<LL, LL> b) {
if (a.second != b.second)
return a.second < b.second;
else
return a.first < b.first;
}
std::uint32_t euclidean_gcd(std::uint32_t a, std::uint32_t b) {
return b != 0 ? euclidean_gcd(b, a % b) : a;
}
void solve(long long N, long long K, std::vector<int> H) {
SORT(H);
// reverse(ALL(H));
REP(i, K) { H[N - i - 1] = 0; }
LL ans = 0;
REP(i, N) { ans += H[i]; }
cout << ans << endl;
return;
}
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::vector<int> H(N);
for (int i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
solve(N, K, std::move(H));
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// pair sort
bool compare_by_b(pair<LL, LL> a, pair<LL, LL> b) {
if (a.second != b.second)
return a.second < b.second;
else
return a.first < b.first;
}
std::uint32_t euclidean_gcd(std::uint32_t a, std::uint32_t b) {
return b != 0 ? euclidean_gcd(b, a % b) : a;
}
void solve(long long N, long long K, std::vector<int> H) {
SORT(H);
// reverse(ALL(H));
if (K > N) {
cout << 0 << endl;
return;
}
REP(i, K) { H[N - i - 1] = 0; }
LL ans = 0;
REP(i, N) { ans += H[i]; }
cout << ans << endl;
return;
}
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::vector<int> H(N);
for (int i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
solve(N, K, std::move(H));
return 0;
}
| insert | 96 | 96 | 96 | 100 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define LL unsigned long long int
#define SZ 110
int g[SZ];
int mex(set<int> &grnd) {
int i = 0;
for (const int &x : grnd) {
if (x != i)
return i;
i++;
}
return i;
}
int grundy(int n) {
if (g[n] != -1)
return g[n];
if (n < 2)
return g[n] = 0;
set<int> grnd;
for (int i = 1; i <= n; i++)
if (n % (n - i) == 0)
grnd.insert(grundy(n - i));
return g[n] = mex(grnd);
}
int result(int n, int m) {
int jor = 0;
if (n & 1)
jor = grundy(m);
return jor;
}
int towerBreakers(int n, int m) {
if (result(n, m))
return 1;
return 2;
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
LL n, a, k, i, sum = 0, d;
vector<int> h;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> d;
h.push_back(d);
}
sort(h.begin(), h.end());
k = n - k;
for (i = 0; i < k; i++)
sum += h[i];
cout << sum << endl;
return 0;
}
/**
2
2 2
1 4
*/
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define LL unsigned long long int
#define SZ 110
int g[SZ];
int mex(set<int> &grnd) {
int i = 0;
for (const int &x : grnd) {
if (x != i)
return i;
i++;
}
return i;
}
int grundy(int n) {
if (g[n] != -1)
return g[n];
if (n < 2)
return g[n] = 0;
set<int> grnd;
for (int i = 1; i <= n; i++)
if (n % (n - i) == 0)
grnd.insert(grundy(n - i));
return g[n] = mex(grnd);
}
int result(int n, int m) {
int jor = 0;
if (n & 1)
jor = grundy(m);
return jor;
}
int towerBreakers(int n, int m) {
if (result(n, m))
return 1;
return 2;
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
LL n, a, k, i, sum = 0, d;
vector<int> h;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> d;
h.push_back(d);
}
if (k >= n) {
puts("0");
return 0;
}
sort(h.begin(), h.end());
k = n - k;
for (i = 0; i < k; i++)
sum += h[i];
cout << sum << endl;
return 0;
}
/**
2
2 2
1 4
*/
| insert | 71 | 71 | 71 | 75 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long> H(N);
if (N <= K) {
cout << 0 << endl;
} else {
for (int i = 0; i < N; i++)
cin >> H.at(i);
for (int i = 0; i < K; i++) {
for (int j = 0; j < N - i - 1; j++) {
if (H.at(j) > H.at(j + 1)) {
int a = H.at(j);
H.at(j) = H.at(j + 1);
H.at(j + 1) = a;
};
};
};
long ans = 0;
for (int i = 0; i < N - K; i++)
ans += H.at(i);
cout << ans << endl;
};
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
long long ans;
ans = 0;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
sort(h.begin(), h.end());
for (int i = 0; i < n - k; i++)
ans += h.at(i);
cout << ans << endl;
} | replace | 4 | 26 | 4 | 15 | TLE | |
p02785 | Python | Time Limit Exceeded | class Solution:
def solve(self, H, k, monsters):
monsters.sort(reverse=True)
i = 0
while i < k and len(monsters) > 0:
monsters.pop(0)
i += 1
ans = 0
for monster in monsters:
ans += monster
return ans
sol = Solution()
[H, k] = list(map(int, input().strip().split()))
monsters = list(map(int, input().strip().split()))
print(sol.solve(H, k, monsters))
| class Solution:
def solve(self, H, k, monsters):
monsters.sort(reverse=True)
return sum(monsters[k:])
sol = Solution()
[H, k] = list(map(int, input().strip().split()))
monsters = list(map(int, input().strip().split()))
print(sol.solve(H, k, monsters))
| replace | 4 | 16 | 4 | 5 | TLE | |
p02785 | Python | Time Limit Exceeded | N, K = [int(_) for _ in input().split()]
H = [int(_) for _ in input().split()]
list_H = sorted(H, reverse=True)
if len(H) < K:
print(0)
else:
for k in range(K):
if len(list_H) > 0:
list_H.pop(0)
print(sum(list_H))
| N, K = [int(_) for _ in input().split()]
H = [int(_) for _ in input().split()]
H.sort(reverse=True)
print(sum(H[K:]))
| replace | 2 | 10 | 2 | 4 | TLE | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, k, h[100001];
long long count = 0;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
sort(h, h + n);
for (int i = n - 1 - k; i >= 0; i--) {
count += h[i];
}
printf("%lld", count);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, k, h[200001];
long long count = 0;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
sort(h, h + n);
for (int i = n - 1 - k; i >= 0; i--) {
count += h[i];
}
printf("%lld", count);
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
bool dp[100100];
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(H.begin(), H.end(), greater<int>());
rep(i, K) H[i] = 0;
long long ans = 0;
rep(i, N) ans += H[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
bool dp[100100];
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(H.begin(), H.end(), greater<int>());
rep(i, min(N, K)) H[i] = 0;
long long ans = 0;
rep(i, N) ans += H[i];
cout << ans << endl;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
const int MAX = 510000;
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;
}
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
VE h(n);
rep(i, n) cin >> h[i];
sort(ALLR(h));
rep(i, k) h[i] = 0;
int ans = 0;
rep(i, n) { ans += h[i]; }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
const int MAX = 510000;
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;
}
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
VE h(n);
rep(i, n) cin >> h[i];
sort(ALLR(h));
rep(i, min(n, k)) h[i] = 0;
int ans = 0;
rep(i, n) { ans += h[i]; }
cout << ans << endl;
return 0;
} | replace | 154 | 155 | 154 | 155 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int cmp(int x, int y) { return x > y; }
int main() {
int n, k;
int a[100005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
if (n <= k)
cout << "0";
else {
long long s = 0;
for (int i = k; i < n; i++)
s += a[i];
cout << s << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int cmp(int x, int y) { return x > y; }
int main() {
int n, k;
int a[200005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
if (n <= k)
cout << "0";
else {
long long s = 0;
for (int i = k; i < n; i++)
s += a[i];
cout << s << endl;
}
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int k, n, i;
long long int c = 0, h[100000];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n, greater<int>());
for (i = k; i < n; i++) {
c += h[i];
}
{ cout << c << endl; }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int k, n, i;
long long int c = 0, h[1000000];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n, greater<int>());
for (i = k; i < n; i++) {
c += h[i];
}
{ cout << c << endl; }
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vi vector<int>
#define br cout << "\n";
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define tr(c, i) for (auto i : c)
#define pii pair<int, int>
#define fast_io() \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define pq \
priority_queue<pair<ll, pii>, vector<pair<ll, pii>>, greater<pair<ll, pii>>> \
p; // container adapter makes ascending q
#define er(x) cout << x << " "
#define err(x, y) cout << x << " " << y
using namespace std;
const ll MAX = 1000 * 1000;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 301;
const int INF = INT_MAX;
const int M = 200005;
int main() {
ll n, k;
cin >> n >> k;
std::vector<ll> h;
for (auto &x : h)
cin >> x;
sort(rall(h));
ll sum = 0;
for (int i = k; i < n; ++i)
sum += h[i];
cout << sum;
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vi vector<int>
#define br cout << "\n";
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define tr(c, i) for (auto i : c)
#define pii pair<int, int>
#define fast_io() \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define pq \
priority_queue<pair<ll, pii>, vector<pair<ll, pii>>, greater<pair<ll, pii>>> \
p; // container adapter makes ascending q
#define er(x) cout << x << " "
#define err(x, y) cout << x << " " << y
using namespace std;
const ll MAX = 1000 * 1000;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 301;
const int INF = INT_MAX;
const int M = 200005;
int main() {
ll n, k;
cin >> n >> k;
std::vector<ll> h(n);
for (auto &x : h)
cin >> x;
sort(rall(h));
ll sum = 0;
for (int i = k; i < n; ++i)
sum += h[i];
cout << sum;
return 0;
}
| replace | 34 | 35 | 34 | 35 | -11 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n, k;
cin >> n >> k;
long long int arr[n], sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
reverse(arr, arr + n);
for (int j = 0; j < k; j++) {
arr[j] = 0;
}
for (int i = 0; i < n; i++) {
sum = sum + arr[i];
}
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n, k;
cin >> n >> k;
long long int arr[n], sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
reverse(arr, arr + n);
for (int j = 0; j < k; j++) {
if (j < n)
arr[j] = 0;
}
for (int i = 0; i < n; i++) {
sum = sum + arr[i];
}
cout << sum;
return 0;
} | replace | 14 | 15 | 14 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
int main() {
int N, K;
cin >> N >> K;
ll H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + K);
if (K >= N) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
for (int i = 0; i < N - K; i++)
ans += H[i];
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
int main() {
int N, K;
cin >> N >> K;
ll H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N);
if (K >= N) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
for (int i = 0; i < N - K; i++)
ans += H[i];
cout << ans << endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02785 | C++ | Runtime Error | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
mint POW(mint n, int p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
mint t = POW(n, p / 2);
return t * t;
}
return n * POW(n, p - 1);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n, k;
cin >> n >> k;
VE h(n);
rep(i, n) cin >> h[i];
int ans = 0;
sort(ALLR(h));
rep(i, k) h[i] = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
return 0;
} | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
mint POW(mint n, int p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
mint t = POW(n, p / 2);
return t * t;
}
return n * POW(n, p - 1);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n, k;
cin >> n >> k;
VE h(n);
rep(i, n) cin >> h[i];
int ans = 0;
sort(ALLR(h));
rep(i, min(n, k)) h[i] = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
return 0;
} | replace | 242 | 243 | 242 | 243 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int a[30000];
bool cmp(int x, int y) { return x > y; }
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
ll sum = 0;
for (int i = k; i < n; i++)
sum += a[i];
cout << sum << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int a[300000];
bool cmp(int x, int y) { return x > y; }
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
ll sum = 0;
for (int i = k; i < n; i++)
sum += a[i];
cout << sum << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int n, k;
ll h[100000];
cin >> n >> k;
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;
ll sum = 0;
for (int i = 0; i < n; i++)
sum += h[i];
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int n, k;
ll h[200000];
cin >> n >> k;
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;
ll sum = 0;
for (int i = 0; i < n; i++)
sum += h[i];
cout << sum << endl;
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#define LL long long
using namespace std;
int n, t;
int p;
LL ans;
int a[100002];
inline int qr() {
int w = 1, x = 0;
char a = 0;
while (a < '0' || a > '9') {
if (a == '-')
w = -1;
a = getchar();
}
while (a >= '0' && a <= '9') {
x = (x << 3) + (x << 1) + (a ^ 48);
a = getchar();
}
return x * w;
}
bool mycmp(int a, int b) { return a > b; }
int main() {
n = qr();
t = qr();
for (int i = 1; i <= n; i++)
a[i] = qr();
sort(a + 1, a + n + 1, mycmp);
if (t >= n)
cout << "0" << endl;
else {
for (int i = t + 1; i <= n; i++)
ans += a[i];
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#define LL long long
using namespace std;
int n, t;
int p;
LL ans;
int a[900002];
inline int qr() {
int w = 1, x = 0;
char a = 0;
while (a < '0' || a > '9') {
if (a == '-')
w = -1;
a = getchar();
}
while (a >= '0' && a <= '9') {
x = (x << 3) + (x << 1) + (a ^ 48);
a = getchar();
}
return x * w;
}
bool mycmp(int a, int b) { return a > b; }
int main() {
n = qr();
t = qr();
for (int i = 1; i <= n; i++)
a[i] = qr();
sort(a + 1, a + n + 1, mycmp);
if (t >= n)
cout << "0" << endl;
else {
for (int i = t + 1; i <= n; i++)
ans += a[i];
cout << ans << endl;
}
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const lint MOD = 1e9 + 7;
const double EPS = 1e-10;
int main() {
int n, k;
cin >> n >> k;
vector<lint> H(n, 0);
rep(i, n) { cin >> H[i]; }
sort(all(H));
reverse(all(H));
for (int i = 0; i < k; i++) {
H[i] = 0;
}
lint total = 0;
for (int i = 0; i < n; i++) {
total += H[i];
}
cout << total << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const lint MOD = 1e9 + 7;
const double EPS = 1e-10;
int main() {
int n, k;
cin >> n >> k;
if (n <= k) {
cout << 0 << endl;
// d("hello");
return 0;
}
vector<lint> H(n, 0);
rep(i, n) { cin >> H[i]; }
sort(all(H));
reverse(all(H));
for (int i = 0; i < k; i++) {
H[i] = 0;
}
lint total = 0;
for (int i = 0; i < n; i++) {
total += H[i];
}
cout << total << endl;
return 0;
} | insert | 32 | 32 | 32 | 37 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, a[100005], mx;
long long cnt;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
if (n - m <= 0) {
cout << 0;
return 0;
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - m; i++) {
cnt += a[i];
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, m, a[1000005], mx;
long long cnt;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
if (n - m <= 0) {
cout << 0;
return 0;
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - m; i++) {
cnt += a[i];
}
cout << cnt;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | /*
Author : Hocky Yudhiono
Min 26 Jan 2020 07:04:17 WIB
1. You can sort the query if offline!
2. Don't bring the dp remaining state when dfsing on DP on Tree.
3. Try to reverse (Think from the back) if you stuck.
4. Be careful when submitting Div. 2 D-F, dont waste it on stupid WAs.
5. Try to reduce a problem
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
// If the time limit is strict, try not to use long double
#define popf pop_front
#define pf push_front
#define popb pop_back
#define mp make_pair
#define pb push_back
#define remove erase
#define fi first
#define se second
// Remember to undefine if the problem is interactive
#define endl '\n'
#define DEBUG(X) \
cout << ">>> DEBUG(" << __LINE__ << ") " << #X << " = " << (X) << endl
const double eps = 1e-9;
const int INFMEM = 63;
const int INF = 1061109567;
const LL LINF = 4557430888798830399LL;
const double DINF = numeric_limits<double>::infinity();
const LL MOD = 1000000007;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
const double PI = 3.141592653589793;
inline void open(string a) {
freopen((a + ".in").c_str(), "r", stdin);
freopen((a + ".out").c_str(), "w", stdout);
}
inline void fasterios() {
// Do not use if interactive
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
LL n, k;
LL isi[100005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> isi[i];
}
sort(isi + 1, isi + 1 + n, greater<LL>());
LL sum = 0;
for (int i = min(n, k) + 1; i <= n; i++) {
sum += isi[i];
}
cout << sum << endl;
return 0;
} | /*
Author : Hocky Yudhiono
Min 26 Jan 2020 07:04:17 WIB
1. You can sort the query if offline!
2. Don't bring the dp remaining state when dfsing on DP on Tree.
3. Try to reverse (Think from the back) if you stuck.
4. Be careful when submitting Div. 2 D-F, dont waste it on stupid WAs.
5. Try to reduce a problem
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
// If the time limit is strict, try not to use long double
#define popf pop_front
#define pf push_front
#define popb pop_back
#define mp make_pair
#define pb push_back
#define remove erase
#define fi first
#define se second
// Remember to undefine if the problem is interactive
#define endl '\n'
#define DEBUG(X) \
cout << ">>> DEBUG(" << __LINE__ << ") " << #X << " = " << (X) << endl
const double eps = 1e-9;
const int INFMEM = 63;
const int INF = 1061109567;
const LL LINF = 4557430888798830399LL;
const double DINF = numeric_limits<double>::infinity();
const LL MOD = 1000000007;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
const double PI = 3.141592653589793;
inline void open(string a) {
freopen((a + ".in").c_str(), "r", stdin);
freopen((a + ".out").c_str(), "w", stdout);
}
inline void fasterios() {
// Do not use if interactive
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
LL n, k;
LL isi[200005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> isi[i];
}
sort(isi + 1, isi + 1 + n, greater<LL>());
LL sum = 0;
for (int i = min(n, k) + 1; i <= n; i++) {
sum += isi[i];
}
cout << sum << endl;
return 0;
} | replace | 73 | 74 | 73 | 74 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pf printf
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sffl(a, b) scanf("%lld %lld", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfffl(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define sffff(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
#define sffffl(a, b, c, d) scanf("%lld %lld %lld %lld", &a, &b, &c, &d)
#define sfffff(a, b, c, d, e) scanf("%d %d %d %d %d", &a, &b, &c, &d, &e)
#define sfffffl(a, b, c, d, e) \
scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e)
#define sfc(a) scanf("%c", &a)
#define pii pair<int, int>
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define pbp(a, b) push_back({a, b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define ff first
#define ss second
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forrev(i, n) for (int i = n - 1; i >= 0; i--)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define forba(i, b, a) for (int i = b; i >= a; i--)
#define stlloop(x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define case1(z) cout << "Case " << z << ": "
#define case2(z) printf("Case %d: ", z)
#define PI acos(-1) // 3.14159265358979323846264338328
#define valid(tx, ty) tx >= 0 && tx < row &&ty >= 0 && ty < col
#define intlim 2147483648
#define N 100005
#define inf 100000008
#define mod 1000000007
/*------------------------------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
/*---------------------------------------------------------------------*/
int main() {
ll n, i, k, a[N], s = 0, j;
cin >> n >> k;
for0(i, n) { cin >> a[i]; }
sort(a, a + n);
for (i = n - 1; i >= 0; i--) {
if (k > 0)
j = 9;
else
s += a[i];
k--;
}
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pf printf
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sffl(a, b) scanf("%lld %lld", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfffl(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define sffff(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
#define sffffl(a, b, c, d) scanf("%lld %lld %lld %lld", &a, &b, &c, &d)
#define sfffff(a, b, c, d, e) scanf("%d %d %d %d %d", &a, &b, &c, &d, &e)
#define sfffffl(a, b, c, d, e) \
scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e)
#define sfc(a) scanf("%c", &a)
#define pii pair<int, int>
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define pbp(a, b) push_back({a, b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define ff first
#define ss second
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forrev(i, n) for (int i = n - 1; i >= 0; i--)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define forba(i, b, a) for (int i = b; i >= a; i--)
#define stlloop(x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define case1(z) cout << "Case " << z << ": "
#define case2(z) printf("Case %d: ", z)
#define PI acos(-1) // 3.14159265358979323846264338328
#define valid(tx, ty) tx >= 0 && tx < row &&ty >= 0 && ty < col
#define intlim 2147483648
#define N 200005
#define inf 100000008
#define mod 1000000007
/*------------------------------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
/*---------------------------------------------------------------------*/
int main() {
ll n, i, k, a[N], s = 0, j;
cin >> n >> k;
for0(i, n) { cin >> a[i]; }
sort(a, a + n);
for (i = n - 1; i >= 0; i--) {
if (k > 0)
j = 9;
else
s += a[i];
k--;
}
cout << s << endl;
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
long long d = accumulate(h, h + n - k, 0LL);
cout << d << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
n = max(0, n - k);
long long d = accumulate(h, h + n, 0LL);
cout << d << "\n";
return 0;
} | replace | 18 | 19 | 18 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <string>
#define all(x) (x).begin(), (x).end()
#define puts(x) cout << x << endl;
#define rep(i, m, n) for (int i = m; i < n; i++)
#define fore(i, a) for (auto i : a)
#define ll long long
using namespace std;
ll n, k;
ll h[100005];
int main() {
cin >> n >> k;
rep(i, 0, n) { cin >> h[i]; }
sort(h, h + n); // 昇順
ll ans = 0;
rep(i, 0, n - k) { ans += h[i]; }
puts(ans);
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <string>
#define all(x) (x).begin(), (x).end()
#define puts(x) cout << x << endl;
#define rep(i, m, n) for (int i = m; i < n; i++)
#define fore(i, a) for (auto i : a)
#define ll long long
using namespace std;
ll n, k;
ll h[1000005];
int main() {
cin >> n >> k;
rep(i, 0, n) { cin >> h[i]; }
sort(h, h + n); // 昇順
ll ans = 0;
rep(i, 0, n - k) { ans += h[i]; }
puts(ans);
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> monsters(n);
unsigned long long total = 0;
for (int i = 0; i < n; i++) {
cin >> monsters[i];
total += monsters[i];
}
sort(monsters.begin(), monsters.end());
if (k == 0)
cout << total << endl;
else if (k >= n) {
cout << 0 << endl;
} else {
for (int i = n - 1; i >= 0; i++) {
total -= monsters[i];
k--;
if (k == 0)
break;
}
cout << total << endl;
}
return 0;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> monsters(n);
unsigned long long total = 0;
for (int i = 0; i < n; i++) {
cin >> monsters[i];
total += monsters[i];
}
sort(monsters.begin(), monsters.end());
if (k == 0)
cout << total << endl;
else if (k >= n) {
cout << 0 << endl;
} else {
for (int i = n - 1; i >= 0; i--) {
total -= monsters[i];
k--;
if (k == 0)
break;
}
cout << total << endl;
}
return 0;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p02785 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
long long n, k, mons[100005], ans;
int main() {
cin >> n >> k;
if (k >= n) {
cout << 0;
return 0;
}
for (int i = 0; i < n; i++)
cin >> mons[i];
sort(mons, mons + n);
for (int i = 0; i < n - k; i++)
ans += mons[i];
cout << ans << endl;
return 0;
} | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
long long n, k, mons[200005], ans;
int main() {
cin >> n >> k;
if (k >= n) {
cout << 0;
return 0;
}
for (int i = 0; i < n; i++)
cin >> mons[i];
sort(mons, mons + n);
for (int i = 0; i < n - k; i++)
ans += mons[i];
cout << ans << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5 + 20;
ll a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
ll n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
if (k >= n)
return cout << 0 << endl, 0;
sort(a, a + n);
for (int i = 0; i < n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 2e5 + 20;
ll a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
ll n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
if (k >= n)
return cout << 0 << endl, 0;
sort(a, a + n);
for (int i = 0; i < n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (n); ++i)
int main() {
int n, k;
cin >> n >> k;
vector<long long> h(n);
long long ans = 0;
rep(i, 0, n) {
cin >> h[i];
ans += h[i];
}
sort(h.begin(), h.end());
for (int i = n - 1; i > n - k - 1; --i) {
ans -= h[i];
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (n); ++i)
int main() {
int n, k;
cin >> n >> k;
vector<long long> h(n);
long long ans = 0;
if (k >= n) {
cout << 0 << endl;
return 0;
}
rep(i, 0, n) {
cin >> h[i];
ans += h[i];
}
sort(h.begin(), h.end());
for (int i = n - 1; i > n - k - 1; --i) {
ans -= h[i];
}
cout << ans << endl;
} | insert | 13 | 13 | 13 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (int i = 0; i < k; i++) {
h[i] = 0;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += h[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (int i = 0; i < k; i++) {
if (i >= n) {
break;
}
h[i] = 0;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += h[i];
}
cout << ans << endl;
} | insert | 13 | 13 | 13 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
ll power(ll a, ll b) { // a^b
ll res = 1;
while (b > 0) {
if (b & 1) {
res = (res * a);
b--;
}
a = (a * a);
b >>= 1;
}
return res;
}
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
vl h(n);
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
sum += h[i];
}
sort(all(h));
for (ll i = n - 1; i >= 0; i++) {
if (k == 0)
break;
sum -= h[i];
k--;
}
cout << sum << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
ll power(ll a, ll b) { // a^b
ll res = 1;
while (b > 0) {
if (b & 1) {
res = (res * a);
b--;
}
a = (a * a);
b >>= 1;
}
return res;
}
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
vl h(n);
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> h[i];
sum += h[i];
}
sort(all(h));
for (ll i = n - 1; i >= 0; i--) {
if (k == 0)
break;
sum -= h[i];
k--;
}
cout << sum << "\n";
} | replace | 36 | 37 | 36 | 37 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define DEB2(X) cout << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define DEB2(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
// typedef std::pair<int,int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define NP(X, Y) next_permutation(X, Y)
#define setdouble(X, Y) cout << fixed << setprecision(X) << Y
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int N, K;
int A[100010];
signed main() {
cin >> N >> K;
REP(i, N) { cin >> A[i]; }
sort(A, A + N, greater<>());
int ans = 0;
for (int i = K; i < N; i++) {
ans += A[i];
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define DEB2(X) cout << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define DEB2(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
// typedef std::pair<int,int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define NP(X, Y) next_permutation(X, Y)
#define setdouble(X, Y) cout << fixed << setprecision(X) << Y
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int N, K;
int A[200010];
signed main() {
cin >> N >> K;
REP(i, N) { cin >> A[i]; }
sort(A, A + N, greater<>());
int ans = 0;
for (int i = K; i < N; i++) {
ans += A[i];
}
cout << ans << endl;
return 0;
}
| replace | 75 | 76 | 75 | 76 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
reverse(all(h));
rep(i, k) h[i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
if (k > n) {
cout << 0 << endl;
return 0;
}
sort(all(h));
reverse(all(h));
rep(i, k) h[i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
return 0;
} | insert | 14 | 14 | 14 | 18 | 0 | |
p02785 | C++ | Runtime Error | // #pragma GCC optimize("O2147483647")
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("inline-small-functions")
// #pragma GCC optimize("-finline-small-functions")
// #pragma GCC optimize("-fexpensive-optimizations")
// #pragma GCC optimize("-funsafe-loop-optimizations")
// #pragma GCC optimize("inline-functions-called-once")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx,avx")
// #pragma GCC optimze("fast-math")
// #define GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include "testlib.h"
#define rep(i, j, k) for (int i = (int)(j); i < (int)(k); i++)
#define per(i, j, k) for (int i = (int)(k); i >= (int)(j); i--)
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)((x).size())
#define fprd fprintf(stderr,
#define fi first
#define se second
#define endl '\n'
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
const int N = 1e5 + 5;
int n, k, a[N];
ll sum = 0;
int main() {
scanf("%d%d", &n, &k);
rep(i, 0, n) scanf("%d", &a[i]);
sort(a, a + n);
rep(i, 0, n - k) sum += a[i];
printf("%lld\n", sum);
} | // #pragma GCC optimize("O2147483647")
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("inline-small-functions")
// #pragma GCC optimize("-finline-small-functions")
// #pragma GCC optimize("-fexpensive-optimizations")
// #pragma GCC optimize("-funsafe-loop-optimizations")
// #pragma GCC optimize("inline-functions-called-once")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx,avx")
// #pragma GCC optimze("fast-math")
// #define GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include "testlib.h"
#define rep(i, j, k) for (int i = (int)(j); i < (int)(k); i++)
#define per(i, j, k) for (int i = (int)(k); i >= (int)(j); i--)
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)((x).size())
#define fprd fprintf(stderr,
#define fi first
#define se second
#define endl '\n'
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
const int N = 2e5 + 5;
int n, k, a[N];
ll sum = 0;
int main() {
scanf("%d%d", &n, &k);
rep(i, 0, n) scanf("%d", &a[i]);
sort(a, a + n);
rep(i, 0, n - k) sum += a[i];
printf("%lld\n", sum);
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int n, m, cnt = 0, aa[110000], k;
pair<int, int> p[110000];
string s;
char c;
signed main() {
cin >> n >> k;
rep(i, n) { cin >> aa[i]; }
sort(aa, aa + n);
rep(i, n - k) { cnt += aa[i]; }
cout << cnt;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int n, m, cnt = 0, aa[220000], k;
pair<int, int> p[110000];
string s;
char c;
signed main() {
cin >> n >> k;
rep(i, n) { cin >> aa[i]; }
sort(aa, aa + n);
rep(i, n - k) { cnt += aa[i]; }
cout << cnt;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (1e5) + 5;
int n, a[N];
int k;
int main() { // claudio van
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
if (k < n) {
sort(a, a + n);
ll sum = 0;
for (int i = 0; i < n - k; ++i) {
sum += a[i];
}
cout << sum << "\n";
} else {
cout << 0 << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (2e5) + 5;
int n, a[N];
int k;
int main() { // claudio van
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
if (k < n) {
sort(a, a + n);
ll sum = 0;
for (int i = 0; i < n - k; ++i) {
sum += a[i];
}
cout << sum << "\n";
} else {
cout << 0 << "\n";
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
int n, k;
int h[100005];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
sort(h, h + n);
ll sum = 0;
for (int i = 0; i < n - k; i++)
sum += h[i];
printf("%lld\n", sum);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
int n, k;
int h[200005];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
sort(h, h + n);
ll sum = 0;
for (int i = 0; i < n - k; i++)
sum += h[i];
printf("%lld\n", sum);
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll result = 0;
ll N = 1, K = 0;
cin >> N >> K;
vector<ll> H(N);
for (ll i = 0; i < N; i++) {
cin >> H[i];
result += H[i];
}
sort(H.begin(), H.end(), greater<ll>());
for (ll i = 0; i < K; i++) {
result -= H[i];
}
cout << result << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll result = 0;
ll N = 1, K = 0;
cin >> N >> K;
vector<ll> H(max(N, K), 0);
for (ll i = 0; i < N; i++) {
cin >> H[i];
result += H[i];
}
sort(H.begin(), H.end(), greater<ll>());
for (ll i = 0; i < K; i++) {
result -= H[i];
}
cout << result << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 20005
#define ll long long
ll a[N];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
if (k >= n)
printf("0");
else {
ll ans = 0;
int c = n - k;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= c; i++)
ans += a[i];
printf("%lld", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define N 200005
#define ll long long
ll a[N];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
if (k >= n)
printf("0");
else {
ll ans = 0;
int c = n - k;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= c; i++)
ans += a[i];
printf("%lld", ans);
}
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(int a, int b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const ll INFS = 1e18;
const int MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
reverse(all(h));
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++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(int a, int b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const ll INFS = 1e18;
const int MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
reverse(all(h));
if (n <= k) {
cout << 0 << endl;
return 0;
}
rep(i, k) { h[i] = 0; }
ll ans = 0;
rep(i, n) { ans += h[i]; }
cout << ans << endl;
} | insert | 29 | 29 | 29 | 33 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#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 srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
rep(i, k) h[i] = 0;
ll sumH = 0;
rep(i, n) { sumH += h[i]; }
cout << sumH << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#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 srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
if (n <= k) {
cout << 0 << endl;
return 0;
}
sort(h.begin(), h.end(), greater<ll>());
rep(i, k) h[i] = 0;
ll sumH = 0;
rep(i, n) { sumH += h[i]; }
cout << sumH << endl;
return 0;
} | replace | 43 | 44 | 43 | 47 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using VL = vector<ll>;
#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++)
const long long INF = 999999999;
ll h[100010];
int main() {
ll n, k, ans = 0;
cin >> n >> k;
REP(i, n) cin >> h[i];
sort(h, h + n);
REPR(i, n - k - 1) { ans += h[i]; }
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using VL = vector<ll>;
#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++)
const long long INF = 999999999;
ll h[200010];
int main() {
ll n, k, ans = 0;
cin >> n >> k;
REP(i, n) cin >> h[i];
sort(h, h + n);
REPR(i, n - k - 1) { ans += h[i]; }
cout << ans << endl;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define db double
#define str string
#define pb push_back
#define nl '\n'
#define X first
#define Y second
#define nimble \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) rbegin(v), rend(v)
#define selp(a) \
for (auto i : a) \
cout << i << " "; \
cout << nl;
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
#define _sz(x) (int)x.size()
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repv(v) for (int i = 0; i < _sz(v); i++)
#define rep1(i, b, a) for (int i = b; i >= a; i--)
#define preci(x) fixed << setprecision(x)
#define TRACE
#ifdef TRACE
#define see(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << nl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#endif
int inf = 0x3f3f3f3f;
ll infl = 0x3f3f3f3f3f3f3f3fLL;
ld infd = 1.0 / 0.0;
const ll MOD = 1e9 + 7; // 998244353 // = (119<<23)+1
const db pi = 2 * acos(0.0);
int main() {
nimble;
int tt = 1; // cin>>tt;
while (tt--) {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
sort(all(a), greater<int>());
rep(i, 0, k) { a[i] = 0; }
ll x = 0;
rep(i, 0, n) x += a[i];
cout << x << nl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define db double
#define str string
#define pb push_back
#define nl '\n'
#define X first
#define Y second
#define nimble \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) rbegin(v), rend(v)
#define selp(a) \
for (auto i : a) \
cout << i << " "; \
cout << nl;
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
#define _sz(x) (int)x.size()
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repv(v) for (int i = 0; i < _sz(v); i++)
#define rep1(i, b, a) for (int i = b; i >= a; i--)
#define preci(x) fixed << setprecision(x)
#define TRACE
#ifdef TRACE
#define see(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << nl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#endif
int inf = 0x3f3f3f3f;
ll infl = 0x3f3f3f3f3f3f3f3fLL;
ld infd = 1.0 / 0.0;
const ll MOD = 1e9 + 7; // 998244353 // = (119<<23)+1
const db pi = 2 * acos(0.0);
int main() {
nimble;
int tt = 1; // cin>>tt;
while (tt--) {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
sort(all(a), greater<int>());
rep(i, 0, k) {
if (i < n)
a[i] = 0;
}
ll x = 0;
rep(i, 0, n) x += a[i];
cout << x << nl;
}
return 0;
}
| replace | 58 | 59 | 58 | 62 | 0 | |
p02785 | Python | Time Limit Exceeded | N, K = map(int, input().split())
list_H = [int(x) for x in input().split()]
list_H.sort()
while K:
if list_H:
list_H.pop()
K -= 1
sum = 0
while list_H:
sum += list_H[0]
list_H.pop(0)
print(sum)
| N, K = map(int, input().split())
list_H = [int(x) for x in input().split()]
list_H.sort()
while K:
if list_H:
list_H.pop()
K -= 1
print(sum(list_H))
| replace | 10 | 16 | 10 | 11 | TLE | |
p02785 | Python | Time Limit Exceeded | import sys
from io import StringIO
import unittest
def resolve():
N, K = [int(i) for i in input().split()]
H = [int(i) for i in input().split()]
for i in range(K):
if len(H) > 0:
idx = H.index(max(H))
H[idx] = 0
else:
break
sumH = 0
if len(H) > 0:
sumH = sum(H)
print(sumH)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 1
4 1 5"""
output = """5"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """8 9
7 9 3 2 3 8 4 6"""
output = """0"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """3 0
1000000000 1000000000 1000000000"""
output = """3000000000"""
self.assertIO(input, output)
if __name__ == "__main__":
# unittest.main()
resolve()
| import sys
from io import StringIO
import unittest
def resolve():
N, K = [int(i) for i in input().split()]
H = sorted([int(i) for i in input().split()])
if N <= K:
H = [0]
else:
# if K < (N - K):
for i in range(K):
H[len(H) - 1 - i] = 0
# else:
# Hs = []
# for i in range(N - K):
# Hs.append(H[i])
# H = Hs
print(sum(H))
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 1
4 1 5"""
output = """5"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """8 9
7 9 3 2 3 8 4 6"""
output = """0"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """3 0
1000000000 1000000000 1000000000"""
output = """3000000000"""
self.assertIO(input, output)
if __name__ == "__main__":
# unittest.main()
resolve()
| replace | 7 | 18 | 7 | 20 | TLE | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
const int MAXN = 100005;
int n, k;
int a[MAXN];
signed main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
if (n <= k) {
cout << 0 << endl;
return 0;
}
sort(a + 1, a + 1 + n);
int sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
const int MAXN = 200005;
int n, k;
int a[MAXN];
signed main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
if (n <= k) {
cout << 0 << endl;
return 0;
}
sort(a + 1, a + 1 + n);
int sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
using namespace std;
const int MOD = 1000000007;
int main() {
ll n, k;
scanf("%lld %lld", &n, &k);
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
scanf("%lld", &h[i]);
}
sort(h.begin(), h.end());
ll sum = 0;
for (ll i = 0; i < h.size() - k; i++) {
sum += h[i];
}
cout << sum << endl;
}
// 3 1
// 4 1 5
| #include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
using namespace std;
const int MOD = 1000000007;
int main() {
ll n, k;
scanf("%lld %lld", &n, &k);
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
scanf("%lld", &h[i]);
}
sort(h.begin(), h.end());
ll sum = 0;
for (ll i = 0; i < (n - k); i++) {
sum += h[i];
}
cout << sum << endl;
}
// 3 1
// 4 1 5
| replace | 21 | 22 | 21 | 22 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> k;
vector<ll> A(n);
for (auto &x : A)
cin >> x;
sort(A.rbegin(), A.rend());
for (i = 0; i < k; i++) {
A[i] = 0;
}
ll ret = 0;
for (i = 0; i < n; i++) {
ret += A[i];
}
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> k;
vector<ll> A(n);
for (auto &x : A)
cin >> x;
sort(A.rbegin(), A.rend());
for (i = 0; i < min(n, k); i++) {
A[i] = 0;
}
ll ret = 0;
for (i = 0; i < n; i++) {
ret += A[i];
}
cout << ret << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
bool cmp(int a, int b) { return a > b; }
int main(void) {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
if (k >= n) {
cout << 0 << endl;
} else {
ll sum = 0;
for (int i = k; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
int a[maxn];
bool cmp(int a, int b) { return a > b; }
int main(void) {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, cmp);
if (k >= n) {
cout << 0 << endl;
} else {
ll sum = 0;
for (int i = k; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll MAX_N = 100000;
int main() {
ll n, k;
ll sum = 0;
ll t;
std::vector<int> H;
scanf("%lld%lld", &n, &k);
rep(i, n) {
scanf("%lld", &t);
H.push_back(t);
}
sort(H.begin(), H.end());
rep(i, n - k) {
// printf("%lld",H.front());
sum += H.front();
H.erase(H.begin());
}
printf("%lld", sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll MAX_N = 100000;
int main() {
ll n, k;
ll sum = 0;
ll t;
std::vector<int> H;
scanf("%lld%lld", &n, &k);
rep(i, n) {
scanf("%lld", &t);
H.push_back(t);
}
sort(H.begin(), H.end());
rep(i, n - k) {
// printf("%lld",H.front());
sum += H[i];
// H.erase(H.begin());
}
printf("%lld", sum);
return 0;
} | replace | 22 | 24 | 22 | 24 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define sd(n) scanf("%d", &n)
#define sl(n) scanf("%lld", &n)
#define met(a, b) \
; \
memset(a, b, sizeof(a));
typedef long long ll;
using namespace std;
double pai = 3.141592653589793;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
// inline long long read() {
// long long tmp=0, fh=1; char c=getchar();
// while (c<'0'||c>'9') {if (c=='-') fh=-1; c=getchar();}
// while (c>='0'&&c<='9') tmp=tmp*10+c-48, c=getchar();
// return tmp*fh;
// }
ll h[200005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%lld", h[i]);
}
sort(h, h + n);
ll ans = 0;
for (int i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define sd(n) scanf("%d", &n)
#define sl(n) scanf("%lld", &n)
#define met(a, b) \
; \
memset(a, b, sizeof(a));
typedef long long ll;
using namespace std;
double pai = 3.141592653589793;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
// inline long long read() {
// long long tmp=0, fh=1; char c=getchar();
// while (c<'0'||c>'9') {if (c=='-') fh=-1; c=getchar();}
// while (c>='0'&&c<='9') tmp=tmp*10+c-48, c=getchar();
// return tmp*fh;
// }
ll h[200005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%lld", &h[i]);
}
sort(h, h + n);
ll ans = 0;
for (int i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans;
} | replace | 37 | 38 | 37 | 38 | -11 | |
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;
const ll mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
ll N, K;
cin >> N >> K;
vector<ll> H(N);
REP(i, N) cin >> H[i];
sort(all(H), greater<ll>());
REP(i, K) H[i] = 0;
ll answer = 0;
REP(i, N) answer += H[i];
cout << answer << "\n";
} | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
ll N, K;
cin >> N >> K;
vector<ll> H(N);
REP(i, N) cin >> H[i];
sort(all(H), greater<ll>());
REP(i, K) {
if (i == N)
break;
H[i] = 0;
}
ll answer = 0;
REP(i, N) answer += H[i];
cout << answer << "\n";
}
| replace | 28 | 29 | 28 | 33 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define ull unsigned long long
int main() {
ull N, K;
cin >> N >> K;
ull A[N];
for (ull i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A, A + N);
ull sum = 0;
for (ull i = 0; i < N - K; ++i) {
sum += A[i];
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define ull signed long long
int main() {
ull N, K;
cin >> N >> K;
ull A[N];
for (ull i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A, A + N);
ull sum = 0;
for (ull i = 0; i < N - K; ++i) {
sum += A[i];
}
cout << sum << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int N, K, C;
ll A[100001];
int B[100001];
vector<int> ans;
int main() {
cin >> N >> K;
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
for (int i = 0; i < N - K; i++) {
sum += A[i];
}
cout << sum << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int N, K, C;
ll A[200001];
int B[200001];
vector<int> ans;
int main() {
cin >> N >> K;
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
for (int i = 0; i < N - K; i++) {
sum += A[i];
}
cout << sum << endl;
} | replace | 11 | 13 | 11 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int h, a, s = 0, b, l, k;
cin >> h >> a;
long long int arr[a];
for (int i = 0; i < h; i++) {
cin >> arr[i];
}
sort(arr, arr + h);
if (a >= h)
cout << 0 << endl;
else {
l = h - a;
s = 0;
k = 0;
for (int i = 0; i < l; i++) {
s += arr[i];
}
cout << s << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int h, a, s = 0, b, l, k;
cin >> h >> a;
long long int arr[h];
for (int i = 0; i < h; i++) {
cin >> arr[i];
}
sort(arr, arr + h);
if (a >= h)
cout << 0 << endl;
else {
l = h - a;
s = 0;
k = 0;
for (int i = 0; i < l; i++) {
s += arr[i];
}
cout << s << endl;
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
#define ll long long
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
ll a[100005];
int main(int argc, char **argv) {
int h, n;
scanf("%d%d", &n, &h);
int sum = 0;
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + n + 1);
ll ans = 0;
for (int i = n - h; i >= 1; i--) {
ans += a[i];
}
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
#define ll long long
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
ll a[200005];
int main(int argc, char **argv) {
int h, n;
scanf("%d%d", &n, &h);
int sum = 0;
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + n + 1);
ll ans = 0;
for (int i = n - h; i >= 1; i--) {
ans += a[i];
}
cout << ans;
return 0;
} | replace | 6 | 7 | 6 | 7 | 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 PI 3.141592653589793
#define ALL(v) v.begin(), v.end()
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.rbegin(), H.rend());
for (ll i = 0; i < K; i++) {
H[i] = 0;
}
ll atk = 0;
for (ll i = 0; i < N; i++) {
atk += H[i];
}
cout << atk << 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 PI 3.141592653589793
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
if (K > N) {
cout << 0 << endl;
return 0;
}
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 atk = 0;
for (ll i = 0; i < N; i++) {
atk += H[i];
}
cout << atk << endl;
} | insert | 13 | 13 | 13 | 17 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
long ans = 0;
if (N <= K)
cout << ans << endl;
else {
sort(H.begin(), H.end());
sort(H.begin(), H.end(), greater<int>());
// reverse(H.begin(), H.end());
for (int i = 0; i < K; i++)
H.erase(H.begin());
for (int i = 0; i < H.size(); i++)
ans += H.at(i);
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
long ans = 0;
if (N <= K)
cout << ans << endl;
else {
sort(H.begin(), H.end());
// sort(H.begin(),H.end(),greater<int>());
//// reverse(H.begin(), H.end());
// for(int i=0;i<K;i++) H.erase(H.begin());
for (int i = 0; i < N - K; i++)
ans += H.at(i);
cout << ans << endl;
}
}
| replace | 14 | 19 | 14 | 18 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
long long gcd(long long a, long long b) {
if (a < b)
return gcd(b, a);
long long r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
long long N, K, sum = 0;
cin >> N >> K;
vector<long long> H(N);
for (size_t i = 0; i < N; i++) {
cin >> H.at(i);
}
sort(H.begin(), H.end(), greater<int>());
for (size_t i = 0; i < K; i++) {
H.at(i) = 0;
}
for (size_t i = 0; i < N; i++) {
sum += H.at(i);
}
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
long long gcd(long long a, long long b) {
if (a < b)
return gcd(b, a);
long long r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
long long N, K, sum = 0;
cin >> N >> K;
vector<long long> H(N);
for (size_t i = 0; i < N; i++) {
cin >> H.at(i);
}
sort(H.begin(), H.end(), greater<int>());
for (size_t i = 0; i < min(K, N); i++) {
H.at(i) = 0;
}
for (size_t i = 0; i < N; i++) {
sum += H.at(i);
}
cout << sum;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MEM 100001
#define sanic ios_base::sync_with_stdio(0)
using namespace std;
const long long MOD = 1e9 + 9;
long long a, b, t;
long long p[MEM];
int main() {
cin >> a >> b;
for (int i = 1; i <= a; i++)
cin >> p[i];
sort(p + 1, p + a + 1, greater<int>());
for (int i = b + 1; i <= a; i++)
t += p[i];
cout << t;
}
| #include <bits/stdc++.h>
#define MEM 400001
#define sanic ios_base::sync_with_stdio(0)
using namespace std;
const long long MOD = 1e9 + 9;
long long a, b, t;
long long p[MEM];
int main() {
cin >> a >> b;
for (int i = 1; i <= a; i++)
cin >> p[i];
sort(p + 1, p + a + 1, greater<int>());
for (int i = b + 1; i <= a; i++)
t += p[i];
cout << t;
}
| replace | 1 | 2 | 1 | 2 | 0 | |
p02785 | C++ | Runtime Error | /*
NEVER GIVE UP!
THE EXPERT IN ANYTHING WAS ONCE A BEGINNER
*/
#pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define f(i, a, b) for (ll i = a; i <= b; i++)
#define fi(i, a, b) for (ll i = a; i >= b; i--)
#define fa(x, b) for (auto x : b)
#define TC \
ll test_case; \
cin >> test_case; \
for (ll number = 1; number <= test_case; number++)
#define vll vector<ll>
#define pb push_back
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
#define sz(a) (ll)(a).size()
#define sp(x) cout << fixed << setprecision(x);
#define ReadFile freopen("input.txt", "r", stdin)
#define WriteFile freopen("output.txt", "w", stdout)
#define endl "\n"
const ld pi = acos(-1);
const ll M = 1e9 + 7, N = 1e7 + 5, INF = 1e18;
void solve() {
ll k, n, s = 0;
cin >> n >> k;
vll a(n);
f(i, 0, n - 1) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
f(i, k, n - 1) s += a[i];
cout << s;
}
int32_t main() {
FIO solve();
return 0;
} | /*
NEVER GIVE UP!
THE EXPERT IN ANYTHING WAS ONCE A BEGINNER
*/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define f(i, a, b) for (ll i = a; i <= b; i++)
#define fi(i, a, b) for (ll i = a; i >= b; i--)
#define fa(x, b) for (auto x : b)
#define TC \
ll test_case; \
cin >> test_case; \
for (ll number = 1; number <= test_case; number++)
#define vll vector<ll>
#define pb push_back
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
#define sz(a) (ll)(a).size()
#define sp(x) cout << fixed << setprecision(x);
#define ReadFile freopen("input.txt", "r", stdin)
#define WriteFile freopen("output.txt", "w", stdout)
#define endl "\n"
const ld pi = acos(-1);
const ll M = 1e9 + 7, N = 1e7 + 5, INF = 1e18;
void solve() {
ll k, n, s = 0;
cin >> n >> k;
vll a(n);
f(i, 0, n - 1) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
f(i, k, n - 1) s += a[i];
cout << s;
}
int32_t main() {
FIO solve();
return 0;
} | delete | 5 | 9 | 5 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define inf 1000000000
#define mod 1073741824
#pragma GCC optimization("O3")
using namespace std;
const int N = 100 * 1000 + 5;
#define all(x) begin(x), end(x)
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ios_base::sync_with_stdio(0);
cin.tie(NULL);
long long int n, a, b, c = 0, m = 1e18;
cin >> n >> a;
vector<long long int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < a; ++i) {
v[i] = 0;
}
for (int i = 0; i < n; ++i) {
if (v[i] != 0) {
c += v[i];
}
}
cout << c << "\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define inf 1000000000
#define mod 1073741824
#pragma GCC optimization("O3")
using namespace std;
const int N = 100 * 1000 + 5;
#define all(x) begin(x), end(x)
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ios_base::sync_with_stdio(0);
cin.tie(NULL);
long long int n, a, b, c = 0, m = 1e18;
cin >> n >> a;
vector<long long int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = a; i < n; ++i) {
c += v[i];
}
cout << c << "\n";
return 0;
}
| replace | 44 | 51 | 44 | 46 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
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());
rep(i, K) { H[i] = 0; }
ll ans = 0;
rep(i, N) { ans += H[i]; }
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
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());
rep(i, min(K, N)) { H[i] = 0; }
ll ans = 0;
rep(i, N) { ans += H[i]; }
cout << ans << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP \
cin.tie(0); \
ios::sync_with_stdio(false);
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<char, char> PCC;
typedef pair<ll, ll> PLL;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<ll, char> PLC;
typedef pair<char, ll> PCL;
inline void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
inline void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
inline void Yay(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
int main(void) {
SPEEDUP
cout << setprecision(15);
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(all(H), greater<int>());
rep(i, K) H[i] = 0;
ll sum = 0;
rep(i, N) sum += (ll)H[i];
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP \
cin.tie(0); \
ios::sync_with_stdio(false);
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<char, char> PCC;
typedef pair<ll, ll> PLL;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<ll, char> PLC;
typedef pair<char, ll> PCL;
inline void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
inline void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
inline void Yay(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
int main(void) {
SPEEDUP
cout << setprecision(15);
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(all(H), greater<int>());
rep(i, min(K, N)) H[i] = 0;
ll sum = 0;
rep(i, N) sum += (ll)H[i];
cout << sum << endl;
return 0;
}
| replace | 41 | 42 | 41 | 42 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 1e5 + 7;
int h[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
scanf("%d", &h[i]);
sort(h, h + n, greater<int>());
long long res = 0;
for (int i = k; i < n; ++i)
res += h[i];
cout << res;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 2e5 + 7;
int h[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
scanf("%d", &h[i]);
sort(h, h + n, greater<int>());
long long res = 0;
for (int i = k; i < n; ++i)
res += h[i];
cout << res;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359;
// %llu %lf
// v:vector type:型 order:greater(大きい順) or less(小さい順)
#define _sort(v, type, order) \
do { \
sort(v.begin(), v.end(), order<type>()); \
} while (0)
// vector 要素の総和算出
// v:vector default_value:初期値
#define _sum(v, default_value) accumulate(v.begin(), v.end(), default_value)
// vector 最大値( return ite )
#define _max_element(v) max_element(v.begin(), v.end())
// vector 最小値( return ite )
#define _min_element(v) min_element(v.begin(), v.end())
// vector 最大値が格納されている要素値
#define _max_element_number(v) \
distance(v.begin(), max_element(v.begin(), v.end()))
// 特定コンテナの中から特定の値をカウントする
#define _count(v, value) count(v.begin(), v.end(), value)
// set<uint32_t> member; // 重複するデータを保持する事はできない
// member.insert(2) member.insert(2) ⇒ member.count(2)は1
// member.emplace(2)とかも同じ
// multiset<uint32_t> v; // 重複するデータも保持する事はできる
// member.insert(2) member.insert(2) ⇒ member.count(2)は2
// 丸め
#define _round(v) round(v)
// 2乗 / 3乗
#define _square(v) pow(v, 2)
#define _cube(v) pow(v, 3)
// 大小判定
#define _max(x, y) max(x, y)
#define _min(x, y) min(x, y)
// string ⇒ int
#define _stringtoi(s) stoi(s)
// double 平方根
#define _sqrt(x) sqrt(x)
// double 引数 x 以上で最小の整数値 ex) 3.30303 ⇒ 4
#define _ceil(x) ceil(x)
// 指定された要素以上の値が現れる最初の位置のイテレータを取得する
#define _lower_bound(v, min) lower_bound(v.begin(), v.end(), min)
// 指定された要素より大きい値が現れる最初の位置のイテレータを取得する
#define _upper_bound(v, min) upper_bound(v.begin(), v.end(), min)
// 順列 n個の数が与えられる
// 0,1,2,...,n-1
// 全ての並べ方を1行ごとに出力する
// ex 0 1 2 / 0 2 1 / 1 0 2 / 1 2 0 / 2 0 1 / 2 1 0
#define _next_permutation(v) \
do { \
for (auto num : v) { \
printf("%d ", num); \
} \
printf("\n"); \
} while (next_permutation(v.begin(), v.end()))
// 絶対値
template <typename T> static T _abs(const T x) { return (x > 0 ? x : -x); }
// 最大公約数
int64_t gcd(int64_t a, int64_t b) {
while (b) {
int64_t c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
int64_t lcm(int64_t a, int64_t b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
// 多次元 std::vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
// ex) auto dp = make_vec<uint64_t>(SIZE + 1, 2, 2);
// ■
// UINT32_MAX
// 4294967295 ≒ 4 * 1e9
// ■
// 割り算した結果との比較での丸め対処時
// ABC 161 B
// https://atcoder.jp/contests/abc161/tasks/abc161_b
// double border = _sum(v, 0 / (double)(4 * m);
// ↓
// uint32_t border = (_sum(v, 0) + (4 * m) - 1) / (4 * m);
// ■
// N の数が与えられた場合の組合せ N * (N - 1) / 2
/*
*/
// ABC 153 C
// https://atcoder.jp/contests/abc153/tasks/abc153_c
int main() {
uint32_t n, k;
cin >> n >> k;
vector<uint64_t> v(n);
uint64_t sum = 0;
for (uint32_t i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
if (n <= k) {
printf("0\n");
return 0;
}
_sort(v, uint64_t, greater);
for (uint32_t i = 0; i < k; i++) {
sum -= v[0];
v.erase(v.begin());
}
printf("%llu\n", sum);
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359;
// %llu %lf
// v:vector type:型 order:greater(大きい順) or less(小さい順)
#define _sort(v, type, order) \
do { \
sort(v.begin(), v.end(), order<type>()); \
} while (0)
// vector 要素の総和算出
// v:vector default_value:初期値
#define _sum(v, default_value) accumulate(v.begin(), v.end(), default_value)
// vector 最大値( return ite )
#define _max_element(v) max_element(v.begin(), v.end())
// vector 最小値( return ite )
#define _min_element(v) min_element(v.begin(), v.end())
// vector 最大値が格納されている要素値
#define _max_element_number(v) \
distance(v.begin(), max_element(v.begin(), v.end()))
// 特定コンテナの中から特定の値をカウントする
#define _count(v, value) count(v.begin(), v.end(), value)
// set<uint32_t> member; // 重複するデータを保持する事はできない
// member.insert(2) member.insert(2) ⇒ member.count(2)は1
// member.emplace(2)とかも同じ
// multiset<uint32_t> v; // 重複するデータも保持する事はできる
// member.insert(2) member.insert(2) ⇒ member.count(2)は2
// 丸め
#define _round(v) round(v)
// 2乗 / 3乗
#define _square(v) pow(v, 2)
#define _cube(v) pow(v, 3)
// 大小判定
#define _max(x, y) max(x, y)
#define _min(x, y) min(x, y)
// string ⇒ int
#define _stringtoi(s) stoi(s)
// double 平方根
#define _sqrt(x) sqrt(x)
// double 引数 x 以上で最小の整数値 ex) 3.30303 ⇒ 4
#define _ceil(x) ceil(x)
// 指定された要素以上の値が現れる最初の位置のイテレータを取得する
#define _lower_bound(v, min) lower_bound(v.begin(), v.end(), min)
// 指定された要素より大きい値が現れる最初の位置のイテレータを取得する
#define _upper_bound(v, min) upper_bound(v.begin(), v.end(), min)
// 順列 n個の数が与えられる
// 0,1,2,...,n-1
// 全ての並べ方を1行ごとに出力する
// ex 0 1 2 / 0 2 1 / 1 0 2 / 1 2 0 / 2 0 1 / 2 1 0
#define _next_permutation(v) \
do { \
for (auto num : v) { \
printf("%d ", num); \
} \
printf("\n"); \
} while (next_permutation(v.begin(), v.end()))
// 絶対値
template <typename T> static T _abs(const T x) { return (x > 0 ? x : -x); }
// 最大公約数
int64_t gcd(int64_t a, int64_t b) {
while (b) {
int64_t c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
int64_t lcm(int64_t a, int64_t b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
// 多次元 std::vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
// ex) auto dp = make_vec<uint64_t>(SIZE + 1, 2, 2);
// ■
// UINT32_MAX
// 4294967295 ≒ 4 * 1e9
// ■
// 割り算した結果との比較での丸め対処時
// ABC 161 B
// https://atcoder.jp/contests/abc161/tasks/abc161_b
// double border = _sum(v, 0 / (double)(4 * m);
// ↓
// uint32_t border = (_sum(v, 0) + (4 * m) - 1) / (4 * m);
// ■
// N の数が与えられた場合の組合せ N * (N - 1) / 2
/*
*/
// ABC 153 C
// https://atcoder.jp/contests/abc153/tasks/abc153_c
int main() {
uint32_t n, k;
cin >> n >> k;
vector<uint64_t> v(n);
uint64_t sum = 0;
for (uint32_t i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
if (n <= k) {
printf("0\n");
return 0;
}
_sort(v, uint64_t, greater);
for (uint32_t i = 0; i < k; i++) {
sum -= v[i];
// v.erase(v.begin());
}
printf("%llu\n", sum);
return 0;
}
| replace | 141 | 143 | 141 | 143 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define F first
#define S second
#define int ll
#define f(i, x, n) for (ll i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define edl "\n"
#define ceils(s, n) (s + n - 1) / n
#define str string
#define add insert
#define fast() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
const int MOD = 1e9 + 7, N = 5e5 + 10;
const ll LINF = LLONG_MAX;
int32_t main() {
fast();
int n, k;
cin >> n >> k;
vec q(n);
f(i, 0, n) { cin >> q[i]; }
sort(all(q));
reverse(all(q));
f(i, 0, k) { q[i] = 0; }
int c = 0;
f(i, k, n) { c += q[i]; }
cout << c;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define F first
#define S second
#define int ll
#define f(i, x, n) for (ll i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define edl "\n"
#define ceils(s, n) (s + n - 1) / n
#define str string
#define add insert
#define fast() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
const int MOD = 1e9 + 7, N = 5e5 + 10;
const ll LINF = LLONG_MAX;
int32_t main() {
fast();
int n, k;
cin >> n >> k;
vec q(n);
f(i, 0, n) { cin >> q[i]; }
sort(all(q));
reverse(all(q));
if (k >= n) {
cout << 0;
return 0;
}
f(i, 0, k) { q[i] = 0; }
int c = 0;
f(i, k, n) { c += q[i]; }
cout << c;
return 0;
}
| insert | 32 | 32 | 32 | 36 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define endl "\n"
using namespace std;
void solve() {
// Enter your code here Tanmay:)
int n, k;
cin >> n >> k;
int arr[k];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int sum = 0;
for (int i = n - k - 1; i >= 0; i--) {
sum += arr[i];
}
cout << sum;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
/*
int eulortotent(int n)
{
//Enter your code here Tanmay:)
int total=n;
for(int p=2;p*p<=n;p++)
{
if (n%p==0)
{
total /= p;
total *= (p-1);
while ( n % p == 0 )
n /= p;
}
}
if(n>1)
{
total/=n;
total*=(n-1);
}
return total;
}
*/ | #include <bits/stdc++.h>
#define int long long int
#define endl "\n"
using namespace std;
void solve() {
// Enter your code here Tanmay:)
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int sum = 0;
for (int i = n - k - 1; i >= 0; i--) {
sum += arr[i];
}
cout << sum;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
/*
int eulortotent(int n)
{
//Enter your code here Tanmay:)
int total=n;
for(int p=2;p*p<=n;p++)
{
if (n%p==0)
{
total /= p;
total *= (p-1);
while ( n % p == 0 )
n /= p;
}
}
if(n>1)
{
total/=n;
total*=(n-1);
}
return total;
}
*/ | replace | 8 | 9 | 8 | 9 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1e9
#define all(v) v.begin(), v.end()
#define rall(v) v.begin(), v.end(), std::greater<int>()
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define max(v) *max_element(v.begin(), v.end())
#define min(v) *min_element(v.begin(), v.end())
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k, t;
cin >> n >> k;
vector<int> h;
rep(i, n) {
cin >> t;
h.pb(t);
}
sort(all(h));
for (int i = 0; i < k; i++) {
h[n - 1 - i] = 0;
}
long long sum = 0;
rep(i, n) { sum += h[i]; }
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define INF 1e9
#define all(v) v.begin(), v.end()
#define rall(v) v.begin(), v.end(), std::greater<int>()
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define max(v) *max_element(v.begin(), v.end())
#define min(v) *min_element(v.begin(), v.end())
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k, t;
cin >> n >> k;
vector<int> h;
rep(i, n) {
cin >> t;
h.pb(t);
}
sort(all(h));
for (int i = 0; i < k; i++) {
if (i > n) {
break;
}
h[n - 1 - i] = 0;
}
long long sum = 0;
rep(i, n) { sum += h[i]; }
cout << sum << endl;
return 0;
} | insert | 25 | 25 | 25 | 28 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.