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... | #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... | 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());
... | #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());
... | 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) {
... | #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) {
... | 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, ... | // 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, ... | 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_stri... | #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_stri... | 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... | #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... | 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) cou... | #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) co... | 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];
... | #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++)
... | #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++)
... | 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 ... | #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... | 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 t... | #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 t... | 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()... | #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()... | 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(... | ///**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(... | 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... | #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 ... | 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"WB... | /*
-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"WB... | 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 10000... | #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 10000... | 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... | #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... | 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
#defi... | //{{{
#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
#defi... | 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(... | #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(... | 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
#... | #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
#... | 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 +... | #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 +... | 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;
... | #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;
... | 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--;
e... | #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--;
... | 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);... | #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);
... | 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 <s... | #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 <s... | 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 ... | #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 ... | 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... | #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] ... | 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... | #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... | 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>
#includ... | #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>
#includ... | 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;
... | #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;
... | 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 pi... | #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 pi... | 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 (in... | #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] =... | 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 >= ... | #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 >= ... | 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>
#i... | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// 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>
#i... | 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 << en... | #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 << e... | 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() {
... | #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() {
... | 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 ... | #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 ... | 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.en... | #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.en... | 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 << ... | #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 <<... | 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
*/
#in... | /*
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
*/
#in... | 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... | #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... | 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";
re... | 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... | #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... | 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 tota... | #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 tota... | 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];
cou... | #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];
cou... | 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)
r... | #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)
r... | 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 =... | #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];
an... | 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... | #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 (... | 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--;
... | #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--;
... | 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>
#inc... | #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>
#inc... | 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... | #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... | 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 GC... | // #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 GC... | 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... | #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... | 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;
... | #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;
... | 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... | #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... | 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++) {
resu... | #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++)... | 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... | #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 = ... | 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... | #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... | 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()... | #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()... | 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>
#includ... | #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>
#includ... | 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); ... | #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); ... | 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... | 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:
# ... | 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;
fo... | #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;
fo... | 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.... | #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.... | 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 = ... | #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;
f... | 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 {... | #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 {... | 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, &... | #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, &... | 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... | #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... | 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) {
i... | #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) {
i... | 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) {... | #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) {
... | 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;... | #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;... | 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 =... | #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 =... | 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++)
... | #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++)
... | 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... | #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... | 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>());
// revers... | #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>());
//// ... | 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... | #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... | 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 ... | #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 ... | 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,p... | /*
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.ti... | 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>
#in... | #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>
#in... | 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,... | #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,... | 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 al... | #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 al... | 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 <... | #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 <... | 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
... | #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
... | 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 cei... | #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 cei... | 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--) {
... | #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--) {
... | 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... | #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... | 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.